Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460200003.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PhilosophersDyn-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460200003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 8.2K Apr 11 14:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 14:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 14:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-00
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-01
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-02
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-03
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-04
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-05
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-06
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-07
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-08
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-09
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717106618112

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-03
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-30 22:03:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 22:03:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:03:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 22:03:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 22:03:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2024-05-30 22:03:40] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 22:03:40] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 5 ms.
[2024-05-30 22:03:40] [INFO ] Skeletonized 12 HLPN properties in 1 ms. Removed 4 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 485 steps, including 66 resets, run visited all 12 properties in 35 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-30 22:03:40] [INFO ] Flatten gal took : 16 ms
[2024-05-30 22:03:40] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-30 22:03:40] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 13 ms.
[2024-05-30 22:03:40] [INFO ] Unfolded 16 HLPN properties in 0 ms.
[2024-05-30 22:03:40] [INFO ] Reduced 5 identical enabling conditions.
[2024-05-30 22:03:40] [INFO ] Reduced 5 identical enabling conditions.
[2024-05-30 22:03:40] [INFO ] Reduced 5 identical enabling conditions.
[2024-05-30 22:03:40] [INFO ] Reduced 5 identical enabling conditions.
[2024-05-30 22:03:40] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-30 22:03:41] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2024-05-30 22:03:41] [INFO ] Computed 11 invariants in 14 ms
[2024-05-30 22:03:41] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2024-05-30 22:03:41] [INFO ] Computed 11 invariants in 3 ms
[2024-05-30 22:03:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 22:03:41] [INFO ] Invariant cache hit.
[2024-05-30 22:03:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:41] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2024-05-30 22:03:41] [INFO ] Flatten gal took : 12 ms
[2024-05-30 22:03:41] [INFO ] Flatten gal took : 14 ms
[2024-05-30 22:03:41] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 530 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 22:03:41] [INFO ] Invariant cache hit.
[2024-05-30 22:03:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-30 22:03:41] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-30 22:03:41] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:42] [INFO ] Invariant cache hit.
[2024-05-30 22:03:42] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2024-05-30 22:03:42] [INFO ] Invariant cache hit.
[2024-05-30 22:03:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 22:03:42] [INFO ] Invariant cache hit.
[2024-05-30 22:03:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:42] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-30 22:03:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:42] [INFO ] Invariant cache hit.
[2024-05-30 22:03:42] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 30/30 places, 51/51 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 358 ms.
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-03-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-00 finished in 1241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:43] [INFO ] Invariant cache hit.
[2024-05-30 22:03:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-30 22:03:43] [INFO ] Invariant cache hit.
[2024-05-30 22:03:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 22:03:43] [INFO ] Invariant cache hit.
[2024-05-30 22:03:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-30 22:03:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:43] [INFO ] Invariant cache hit.
[2024-05-30 22:03:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14394 reset in 537 ms.
Stack based approach found an accepted trace after 94 steps with 12 reset with depth 7 and stack size 7 in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-01 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(X(X(G(p1))))&&(G(p2) U p3))||p0))))'
Support contains 24 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:44] [INFO ] Invariant cache hit.
[2024-05-30 22:03:45] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
[2024-05-30 22:03:45] [INFO ] Invariant cache hit.
[2024-05-30 22:03:45] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 22:03:45] [INFO ] Invariant cache hit.
[2024-05-30 22:03:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:45] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-30 22:03:45] [INFO ] Invariant cache hit.
[2024-05-30 22:03:45] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1450 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 473 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p2), (NOT p3), (NOT p1), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 3}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s3 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s8 2) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s12 1) (GEQ s15 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 6 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-02 finished in 1963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!p1)||p0)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:46] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-30 22:03:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 1)), p0:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-04 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-30 22:03:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:46] [INFO ] Invariant cache hit.
[2024-05-30 22:03:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 53 ms :[p0]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s8 1) (LT s9 1) (LT s17 2)) (OR (LT s5 1) (LT s10 1) (LT s16 1) (LT s17 1)) (OR (LT s0 1) (LT s11 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-05 finished in 820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(!p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:47] [INFO ] Invariant cache hit.
[2024-05-30 22:03:47] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2024-05-30 22:03:47] [INFO ] Invariant cache hit.
[2024-05-30 22:03:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 22:03:47] [INFO ] Invariant cache hit.
[2024-05-30 22:03:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:47] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-30 22:03:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:47] [INFO ] Invariant cache hit.
[2024-05-30 22:03:47] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 155 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s10 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14280 reset in 198 ms.
Product exploration explored 100000 steps with 14361 reset in 170 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[false, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[false, (NOT p0), (NOT p0)]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:49] [INFO ] Invariant cache hit.
[2024-05-30 22:03:49] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
[2024-05-30 22:03:49] [INFO ] Invariant cache hit.
[2024-05-30 22:03:49] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 22:03:49] [INFO ] Invariant cache hit.
[2024-05-30 22:03:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:49] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-30 22:03:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:49] [INFO ] Invariant cache hit.
[2024-05-30 22:03:49] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 30/30 places, 51/51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[false, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[false, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14342 reset in 137 ms.
Product exploration explored 100000 steps with 14306 reset in 146 ms.
Built C files in :
/tmp/ltsmin8448476045343495711
[2024-05-30 22:03:50] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-30 22:03:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 22:03:50] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-30 22:03:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 22:03:50] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-30 22:03:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 22:03:50] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8448476045343495711
Running compilation step : cd /tmp/ltsmin8448476045343495711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 269 ms.
Running link step : cd /tmp/ltsmin8448476045343495711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8448476045343495711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3290534023397711802.hoa' '--buchi-type=spotba'
LTSmin run took 206 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PhilosophersDyn-COL-03-LTLFireability-06 finished in 3902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:51] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-30 22:03:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s6 1) (LT s15 1) (LT s23 1)) (OR (LT s3 1) (LT s15 1) (LT s22 1)) (OR (LT s1 1) (LT s16 1) (LT s21 1)) (OR (LT s8 1) (LT s17 1) (LT s23 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-07 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:51] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-30 22:03:51] [INFO ] Invariant cache hit.
[2024-05-30 22:03:51] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s17 1) (LT s20 1)) (OR (LT s16 1) (LT s19 1)) (OR (LT s15 1) (LT s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25550 reset in 141 ms.
Product exploration explored 100000 steps with 25658 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:52] [INFO ] Invariant cache hit.
[2024-05-30 22:03:52] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2024-05-30 22:03:52] [INFO ] Invariant cache hit.
[2024-05-30 22:03:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 22:03:53] [INFO ] Invariant cache hit.
[2024-05-30 22:03:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:53] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-30 22:03:53] [INFO ] Invariant cache hit.
[2024-05-30 22:03:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 30/30 places, 51/51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25634 reset in 161 ms.
Product exploration explored 100000 steps with 25581 reset in 192 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:54] [INFO ] Invariant cache hit.
[2024-05-30 22:03:54] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2024-05-30 22:03:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:54] [INFO ] Invariant cache hit.
[2024-05-30 22:03:54] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 30/30 places, 51/51 transitions.
Built C files in :
/tmp/ltsmin3927830093518660527
[2024-05-30 22:03:54] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3927830093518660527
Running compilation step : cd /tmp/ltsmin3927830093518660527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin3927830093518660527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3927830093518660527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12098972624990522863.hoa' '--buchi-type=spotba'
LTSmin run took 173 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PhilosophersDyn-COL-03-LTLFireability-08 finished in 3709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:55] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, p0]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s10 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-09 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-30 22:03:55] [INFO ] Invariant cache hit.
[2024-05-30 22:03:55] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (AND (GEQ s2 1) (GEQ s3 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s8 2) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s0 1) (G...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 2 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-10 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p1)||p0) U p2))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-30 22:03:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), true, p1]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s24 1) (GEQ s27 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s28 1)) (AND (GEQ s6 1) (GEQ s26 1) (GEQ s29 1)) (AND (GEQ s8 1) (GEQ s26...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-11 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(!p1) U (!p2&&G(!p1))))||p0)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:56] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 22:03:56] [INFO ] Invariant cache hit.
[2024-05-30 22:03:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p2 p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (OR (LT s6 1) (LT s15 1) (LT s23 1)) (OR (LT s3 1) (LT s15 1) (LT s22 1)) (OR (LT s1 1) (LT s16 1) (LT s21 1)) (OR (LT s8 1) (LT s17 1) (LT s23 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p0), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLFireability-12 finished in 939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((G(F(p1)) U !p2))))))'
Support contains 24 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:57] [INFO ] Invariant cache hit.
[2024-05-30 22:03:57] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2024-05-30 22:03:57] [INFO ] Invariant cache hit.
[2024-05-30 22:03:57] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 22:03:57] [INFO ] Invariant cache hit.
[2024-05-30 22:03:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-30 22:03:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:57] [INFO ] Invariant cache hit.
[2024-05-30 22:03:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) p2), (NOT p0), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s24 1) (GEQ s27 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s28 1)) (AND (GEQ s6 1) (GEQ s26 1) (GEQ s29 1)) (AND (GEQ s8 1) (GEQ s26...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-13 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U (G((G(p0)||p1))&&X((!p0 U !p2))))))'
Support contains 24 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:57] [INFO ] Invariant cache hit.
[2024-05-30 22:03:57] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2024-05-30 22:03:57] [INFO ] Invariant cache hit.
[2024-05-30 22:03:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 22:03:57] [INFO ] Invariant cache hit.
[2024-05-30 22:03:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-30 22:03:58] [INFO ] Invariant cache hit.
[2024-05-30 22:03:58] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 531 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), p2, (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), p2, true]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s24 1) (GEQ s27 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s28 1)) (AND (GEQ s6 1) (GEQ s26 1) (GEQ s29 1)) (AND (GEQ s8 1) (GEQ s26...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-14 finished in 821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-30 22:03:58] [INFO ] Invariant cache hit.
[2024-05-30 22:03:58] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2024-05-30 22:03:58] [INFO ] Invariant cache hit.
[2024-05-30 22:03:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 22:03:58] [INFO ] Invariant cache hit.
[2024-05-30 22:03:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-30 22:03:58] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-30 22:03:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 22:03:58] [INFO ] Invariant cache hit.
[2024-05-30 22:03:59] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 120 ms :[p0, p0]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s8 1) (LT s9 1) (LT s17 2)) (OR (LT s5 1) (LT s10 1) (LT s16 1) (LT s17 1)) (OR (LT s0 1) (LT s11 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLFireability-15 finished in 456 ms.
All properties solved by simple procedures.
Total runtime 19247 ms.

BK_STOP 1717106639416

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PhilosophersDyn-COL-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460200003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;