./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix014.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/mix014.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/mix014.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix014.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:24:54,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:24:54,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:24:54,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:24:54,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:24:54,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:24:54,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:24:54,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:24:54,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:24:54,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:24:54,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:24:54,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:24:54,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:24:54,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:24:54,437 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:24:54,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:24:54,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:24:54,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:24:54,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:24:54,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:24:54,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:24:54,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:24:54,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:24:54,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:24:54,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:24:54,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:24:54,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:24:54,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:24:54,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:24:54,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:24:54,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:24:54,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:24:54,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:24:54,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:24:54,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:24:54,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:24:54,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:24:54,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:24:54,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:24:54,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:24:54,444 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:24:54,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:24:54,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:24:54,445 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:24:54,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:24:54,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:24:54,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:24:54,692 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:24:54,693 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:24:54,694 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/mix014.opt.yml/witness.yml [2024-06-28 01:24:54,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:24:54,865 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:24:54,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2024-06-28 01:24:55,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:24:56,176 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:24:56,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2024-06-28 01:24:56,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9fabb9d/da02236cb8ff4fe7a226810c959e4a3f/FLAGb315c290f [2024-06-28 01:24:56,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9fabb9d/da02236cb8ff4fe7a226810c959e4a3f [2024-06-28 01:24:56,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:24:56,207 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:24:56,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:24:56,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:24:56,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:24:56,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:24:54" (1/2) ... [2024-06-28 01:24:56,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2252d0e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:24:56, skipping insertion in model container [2024-06-28 01:24:56,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:24:54" (1/2) ... [2024-06-28 01:24:56,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f7f94a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:24:56, skipping insertion in model container [2024-06-28 01:24:56,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:24:56" (2/2) ... [2024-06-28 01:24:56,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2252d0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56, skipping insertion in model container [2024-06-28 01:24:56,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:24:56" (2/2) ... [2024-06-28 01:24:56,216 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:24:56,364 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:24:56,365 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] (((((((((((((((((((((((! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-06-28 01:24:56,365 INFO L97 edCorrectnessWitness]: Location invariant before [L872-L872] (((((((((((((((((((((((! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-06-28 01:24:56,365 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] (((((((((((((((((((((((! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-06-28 01:24:56,365 INFO L97 edCorrectnessWitness]: Location invariant before [L877-L877] (((((((((((((((((((((((! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-06-28 01:24:56,366 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:24:56,366 INFO L106 edCorrectnessWitness]: ghost_update [L870-L870] multithreaded = 1; [2024-06-28 01:24:56,405 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:24:56,557 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/mix014.opt.i[944,957] [2024-06-28 01:24:56,740 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:24:56,754 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:24:56,783 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/mix014.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:24:56,899 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:24:56,933 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:24:56,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56 WrapperNode [2024-06-28 01:24:56,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:24:56,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:24:56,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:24:56,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:24:56,941 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:24:56" (1/1) ... [2024-06-28 01:24:56,954 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:24:56" (1/1) ... [2024-06-28 01:24:56,999 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2024-06-28 01:24:57,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:24:57,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:24:57,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:24:57,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:24:57,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,032 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:24:57,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:24:57,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:24:57,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:24:57,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:24:57,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (1/1) ... [2024-06-28 01:24:57,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:24:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:24:57,081 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:24:57,091 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:24:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:24:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:24:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:24:57,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:24:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:24:57,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:24:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:24:57,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:24:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:24:57,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:24:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:24:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:24:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:24:57,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:24:57,135 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:24:57,269 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:24:57,271 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:24:57,690 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:24:57,690 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:24:57,800 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:24:57,800 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:24:57,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:24:57 BoogieIcfgContainer [2024-06-28 01:24:57,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:24:57,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:24:57,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:24:57,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:24:57,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:24:54" (1/4) ... [2024-06-28 01:24:57,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e29e45a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:24:57, skipping insertion in model container [2024-06-28 01:24:57,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:24:56" (2/4) ... [2024-06-28 01:24:57,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e29e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:24:57, skipping insertion in model container [2024-06-28 01:24:57,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:56" (3/4) ... [2024-06-28 01:24:57,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e29e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:24:57, skipping insertion in model container [2024-06-28 01:24:57,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:24:57" (4/4) ... [2024-06-28 01:24:57,806 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2024-06-28 01:24:57,818 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:24:57,819 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:24:57,819 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:24:57,854 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:24:57,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:24:57,897 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:24:57,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:24:57,900 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 101 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:24:57,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:24:57,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:24:57,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:24:57,914 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;@65a1d3d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:24:57,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:24:57,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:24:57,917 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:24:57,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:24:57,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:57,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:24:57,918 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:24:57,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 402974639, now seen corresponding path program 1 times [2024-06-28 01:24:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:57,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776045690] [2024-06-28 01:24:57,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:59,008 INFO 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:24:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:59,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776045690] [2024-06-28 01:24:59,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776045690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:59,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:59,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:24:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43567770] [2024-06-28 01:24:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:59,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:24:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:24:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:24:59,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-06-28 01:24:59,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:59,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:59,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-06-28 01:24:59,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:01,424 INFO L124 PetriNetUnfolderBase]: 16085/24327 cut-off events. [2024-06-28 01:25:01,424 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-06-28 01:25:01,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46067 conditions, 24327 events. 16085/24327 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 176233 event pairs, 13643 based on Foata normal form. 601/23144 useless extension candidates. Maximal degree in co-relation 46054. Up to 21467 conditions per place. [2024-06-28 01:25:01,543 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 50 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-28 01:25:01,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 279 flow [2024-06-28 01:25:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:25:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:25:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-06-28 01:25:01,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7062146892655368 [2024-06-28 01:25:01,553 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 125 transitions. [2024-06-28 01:25:01,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 279 flow [2024-06-28 01:25:01,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:01,558 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:25:01,559 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:25:01,561 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:25:01,562 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:25:01,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:01,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:01,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:01,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:25:01,563 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:25:01,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash 711629902, now seen corresponding path program 1 times [2024-06-28 01:25:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:01,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485493436] [2024-06-28 01:25:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485493436] [2024-06-28 01:25:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485493436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:25:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808089641] [2024-06-28 01:25:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:02,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:25:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:25:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:25:02,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2024-06-28 01:25:02,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:02,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:02,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2024-06-28 01:25:02,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:04,747 INFO L124 PetriNetUnfolderBase]: 18319/27423 cut-off events. [2024-06-28 01:25:04,747 INFO L125 PetriNetUnfolderBase]: For 4548/4548 co-relation queries the response was YES. [2024-06-28 01:25:04,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58379 conditions, 27423 events. 18319/27423 cut-off events. For 4548/4548 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 197036 event pairs, 14036 based on Foata normal form. 4/25824 useless extension candidates. Maximal degree in co-relation 58367. Up to 24368 conditions per place. [2024-06-28 01:25:04,886 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 65 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-28 01:25:04,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 400 flow [2024-06-28 01:25:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:25:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:25:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2024-06-28 01:25:04,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-06-28 01:25:04,888 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 4 states and 160 transitions. [2024-06-28 01:25:04,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 400 flow [2024-06-28 01:25:04,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:25:04,890 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 220 flow [2024-06-28 01:25:04,891 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:25:04,891 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:25:04,891 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 220 flow [2024-06-28 01:25:04,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:04,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:04,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:25:04,892 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:25:04,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 585692370, now seen corresponding path program 1 times [2024-06-28 01:25:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671831425] [2024-06-28 01:25:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:05,703 INFO 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:25:05,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671831425] [2024-06-28 01:25:05,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671831425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:05,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:05,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:25:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652217925] [2024-06-28 01:25:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:05,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:25:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:25:05,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:25:05,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-06-28 01:25:05,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:25:05,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:05,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-06-28 01:25:05,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:08,570 INFO L124 PetriNetUnfolderBase]: 23320/34740 cut-off events. [2024-06-28 01:25:08,570 INFO L125 PetriNetUnfolderBase]: For 15128/15128 co-relation queries the response was YES. [2024-06-28 01:25:08,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80944 conditions, 34740 events. 23320/34740 cut-off events. For 15128/15128 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 249394 event pairs, 14958 based on Foata normal form. 7/32806 useless extension candidates. Maximal degree in co-relation 80930. Up to 30752 conditions per place. [2024-06-28 01:25:08,776 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 88 selfloop transitions, 26 changer transitions 0/129 dead transitions. [2024-06-28 01:25:08,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 664 flow [2024-06-28 01:25:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:25:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:25:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2024-06-28 01:25:08,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-06-28 01:25:08,778 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 220 flow. Second operand 5 states and 205 transitions. [2024-06-28 01:25:08,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 664 flow [2024-06-28 01:25:08,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 640 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 01:25:08,783 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 381 flow [2024-06-28 01:25:08,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-06-28 01:25:08,784 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2024-06-28 01:25:08,784 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 381 flow [2024-06-28 01:25:08,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:25:08,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:08,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:08,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:25:08,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:25:08,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1922705125, now seen corresponding path program 1 times [2024-06-28 01:25:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:08,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547512963] [2024-06-28 01:25:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:09,787 INFO 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:25:09,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547512963] [2024-06-28 01:25:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547512963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:09,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:09,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:25:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514469465] [2024-06-28 01:25:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:09,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:25:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:25:09,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:25:09,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-06-28 01:25:09,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:25:09,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:09,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-06-28 01:25:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:12,860 INFO L124 PetriNetUnfolderBase]: 23389/34823 cut-off events. [2024-06-28 01:25:12,861 INFO L125 PetriNetUnfolderBase]: For 36498/36504 co-relation queries the response was YES. [2024-06-28 01:25:12,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93472 conditions, 34823 events. 23389/34823 cut-off events. For 36498/36504 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 249819 event pairs, 12716 based on Foata normal form. 18/32890 useless extension candidates. Maximal degree in co-relation 93455. Up to 30733 conditions per place. [2024-06-28 01:25:13,059 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 99 selfloop transitions, 31 changer transitions 0/145 dead transitions. [2024-06-28 01:25:13,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 145 transitions, 847 flow [2024-06-28 01:25:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:25:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:25:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 240 transitions. [2024-06-28 01:25:13,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-06-28 01:25:13,061 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 381 flow. Second operand 6 states and 240 transitions. [2024-06-28 01:25:13,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 145 transitions, 847 flow [2024-06-28 01:25:13,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 145 transitions, 831 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-28 01:25:13,071 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 477 flow [2024-06-28 01:25:13,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2024-06-28 01:25:13,072 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2024-06-28 01:25:13,072 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 477 flow [2024-06-28 01:25:13,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:25:13,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:13,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:13,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:25:13,073 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:25:13,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1078476456, now seen corresponding path program 1 times [2024-06-28 01:25:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784469022] [2024-06-28 01:25:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:13,744 INFO 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:25:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784469022] [2024-06-28 01:25:13,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784469022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:13,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:13,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:25:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631936519] [2024-06-28 01:25:13,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:13,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:25:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:13,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:25:13,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:25:13,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:25:13,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:25:13,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:13,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:25:13,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:16,975 INFO L124 PetriNetUnfolderBase]: 23393/32281 cut-off events. [2024-06-28 01:25:16,976 INFO L125 PetriNetUnfolderBase]: For 48191/48191 co-relation queries the response was YES. [2024-06-28 01:25:17,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99080 conditions, 32281 events. 23393/32281 cut-off events. For 48191/48191 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 202348 event pairs, 10280 based on Foata normal form. 3/30910 useless extension candidates. Maximal degree in co-relation 99059. Up to 30998 conditions per place. [2024-06-28 01:25:17,154 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 86 selfloop transitions, 12 changer transitions 0/112 dead transitions. [2024-06-28 01:25:17,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 737 flow [2024-06-28 01:25:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:25:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:25:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-06-28 01:25:17,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5728813559322034 [2024-06-28 01:25:17,163 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 477 flow. Second operand 5 states and 169 transitions. [2024-06-28 01:25:17,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 737 flow [2024-06-28 01:25:17,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 112 transitions, 649 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:17,179 INFO L231 Difference]: Finished difference. Result has 80 places, 85 transitions, 425 flow [2024-06-28 01:25:17,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=425, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2024-06-28 01:25:17,180 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2024-06-28 01:25:17,180 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 425 flow [2024-06-28 01:25:17,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:25:17,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:17,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:17,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:25:17,182 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:25:17,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash 926047836, now seen corresponding path program 1 times [2024-06-28 01:25:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916471044] [2024-06-28 01:25:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:18,021 INFO 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:25:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916471044] [2024-06-28 01:25:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916471044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:25:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894896852] [2024-06-28 01:25:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:18,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:25:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:25:18,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:25:18,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:25:18,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 425 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:25:18,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:18,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:25:18,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:21,258 INFO L124 PetriNetUnfolderBase]: 23383/32176 cut-off events. [2024-06-28 01:25:21,261 INFO L125 PetriNetUnfolderBase]: For 50857/50857 co-relation queries the response was YES. [2024-06-28 01:25:21,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99148 conditions, 32176 events. 23383/32176 cut-off events. For 50857/50857 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 200441 event pairs, 10001 based on Foata normal form. 3/30870 useless extension candidates. Maximal degree in co-relation 99125. Up to 30960 conditions per place. [2024-06-28 01:25:21,496 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 98 selfloop transitions, 17 changer transitions 0/129 dead transitions. [2024-06-28 01:25:21,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 129 transitions, 785 flow [2024-06-28 01:25:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:25:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:25:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-06-28 01:25:21,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2024-06-28 01:25:21,498 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 425 flow. Second operand 6 states and 204 transitions. [2024-06-28 01:25:21,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 129 transitions, 785 flow [2024-06-28 01:25:21,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 129 transitions, 749 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:21,521 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 483 flow [2024-06-28 01:25:21,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2024-06-28 01:25:21,524 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 15 predicate places. [2024-06-28 01:25:21,524 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 483 flow [2024-06-28 01:25:21,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:25:21,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:21,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:21,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:25:21,530 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:25:21,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1341288517, now seen corresponding path program 1 times [2024-06-28 01:25:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426988389] [2024-06-28 01:25:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:22,536 INFO 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:25:22,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:22,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426988389] [2024-06-28 01:25:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426988389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:22,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:22,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:25:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905421843] [2024-06-28 01:25:22,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:22,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:25:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:22,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:25:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:25:22,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:25:22,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:25:22,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:22,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:25:22,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:26,235 INFO L124 PetriNetUnfolderBase]: 26697/35803 cut-off events. [2024-06-28 01:25:26,236 INFO L125 PetriNetUnfolderBase]: For 78707/78735 co-relation queries the response was YES. [2024-06-28 01:25:26,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118872 conditions, 35803 events. 26697/35803 cut-off events. For 78707/78735 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 215026 event pairs, 11492 based on Foata normal form. 14/34770 useless extension candidates. Maximal degree in co-relation 118849. Up to 35128 conditions per place. [2024-06-28 01:25:26,536 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 96 selfloop transitions, 31 changer transitions 0/140 dead transitions. [2024-06-28 01:25:26,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 140 transitions, 919 flow [2024-06-28 01:25:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:25:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:25:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-06-28 01:25:26,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5903954802259888 [2024-06-28 01:25:26,538 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 483 flow. Second operand 6 states and 209 transitions. [2024-06-28 01:25:26,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 140 transitions, 919 flow [2024-06-28 01:25:26,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 140 transitions, 863 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:26,574 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 545 flow [2024-06-28 01:25:26,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=545, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-06-28 01:25:26,576 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 17 predicate places. [2024-06-28 01:25:26,576 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 545 flow [2024-06-28 01:25:26,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:25:26,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:26,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:26,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:25:26,577 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:25:26,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1328694537, now seen corresponding path program 2 times [2024-06-28 01:25:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107358780] [2024-06-28 01:25:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:27,632 INFO 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:25:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107358780] [2024-06-28 01:25:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107358780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:25:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906692546] [2024-06-28 01:25:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:27,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:25:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:27,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:25:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:25:27,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:25:27,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 545 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:25:27,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:27,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:25:27,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:31,148 INFO L124 PetriNetUnfolderBase]: 26669/35751 cut-off events. [2024-06-28 01:25:31,149 INFO L125 PetriNetUnfolderBase]: For 86111/86131 co-relation queries the response was YES. [2024-06-28 01:25:31,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120036 conditions, 35751 events. 26669/35751 cut-off events. For 86111/86131 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 214549 event pairs, 11522 based on Foata normal form. 4/34704 useless extension candidates. Maximal degree in co-relation 120012. Up to 35094 conditions per place. [2024-06-28 01:25:31,432 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 89 selfloop transitions, 32 changer transitions 0/134 dead transitions. [2024-06-28 01:25:31,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 879 flow [2024-06-28 01:25:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:25:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:25:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-06-28 01:25:31,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2024-06-28 01:25:31,437 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 545 flow. Second operand 6 states and 204 transitions. [2024-06-28 01:25:31,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 134 transitions, 879 flow [2024-06-28 01:25:31,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 134 transitions, 822 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 01:25:31,477 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 564 flow [2024-06-28 01:25:31,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=564, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2024-06-28 01:25:31,479 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places. [2024-06-28 01:25:31,479 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 564 flow [2024-06-28 01:25:31,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:25:31,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:31,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:31,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:25:31,480 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:25:31,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash 441946943, now seen corresponding path program 1 times [2024-06-28 01:25:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:31,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170608150] [2024-06-28 01:25:31,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:32,674 INFO 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:25:32,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:32,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170608150] [2024-06-28 01:25:32,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170608150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:32,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:32,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:25:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708934980] [2024-06-28 01:25:32,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:32,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:25:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:25:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:25:32,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:25:32,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 564 flow. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:25:32,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:32,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:25:32,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:36,454 INFO L124 PetriNetUnfolderBase]: 27261/36796 cut-off events. [2024-06-28 01:25:36,454 INFO L125 PetriNetUnfolderBase]: For 99822/99850 co-relation queries the response was YES. [2024-06-28 01:25:36,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125237 conditions, 36796 events. 27261/36796 cut-off events. For 99822/99850 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 225264 event pairs, 10722 based on Foata normal form. 6/35653 useless extension candidates. Maximal degree in co-relation 125212. Up to 35389 conditions per place. [2024-06-28 01:25:36,834 INFO L140 encePairwiseOnDemand]: 41/59 looper letters, 130 selfloop transitions, 71 changer transitions 0/214 dead transitions. [2024-06-28 01:25:36,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 214 transitions, 1651 flow [2024-06-28 01:25:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:25:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:25:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 287 transitions. [2024-06-28 01:25:36,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6080508474576272 [2024-06-28 01:25:36,837 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 564 flow. Second operand 8 states and 287 transitions. [2024-06-28 01:25:36,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 214 transitions, 1651 flow [2024-06-28 01:25:36,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 214 transitions, 1451 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:25:36,893 INFO L231 Difference]: Finished difference. Result has 92 places, 137 transitions, 983 flow [2024-06-28 01:25:36,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=983, PETRI_PLACES=92, PETRI_TRANSITIONS=137} [2024-06-28 01:25:36,895 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2024-06-28 01:25:36,895 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 137 transitions, 983 flow [2024-06-28 01:25:36,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:25:36,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:36,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:36,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:25:36,900 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:25:36,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1369731097, now seen corresponding path program 2 times [2024-06-28 01:25:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:36,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372522194] [2024-06-28 01:25:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat