About the Execution of 2023-gold for PhilosophersDyn-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2874.867 | 363467.00 | 407721.00 | 3796.50 | FFFFFFTTFFFFFTFF | normal |
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-171654460300038.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-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460300038
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 93M
-rw-r--r-- 1 mcc users 145K Apr 11 16:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 604K Apr 11 16:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 11 16:11 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 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 306K Apr 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3M Apr 11 18:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45M Apr 11 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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-PT-20-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717107254578
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-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 22:14:16] [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:14:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:14:17] [INFO ] Load time of PNML (sax parser for PT used): 601 ms
[2024-05-30 22:14:17] [INFO ] Transformed 540 places.
[2024-05-30 22:14:17] [INFO ] Transformed 17220 transitions.
[2024-05-30 22:14:17] [INFO ] Parsed PT model containing 540 places and 17220 transitions and 140780 arcs in 797 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 177 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 22:14:17] [INFO ] Reduced 379 identical enabling conditions.
[2024-05-30 22:14:17] [INFO ] Reduced 379 identical enabling conditions.
[2024-05-30 22:14:17] [INFO ] Reduced 379 identical enabling conditions.
[2024-05-30 22:14:17] [INFO ] Reduced 379 identical enabling conditions.
[2024-05-30 22:14:17] [INFO ] Reduced 379 identical enabling conditions.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 161 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2024-05-30 22:14:19] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2024-05-30 22:14:21] [INFO ] Computed 79 invariants in 1328 ms
[2024-05-30 22:14:29] [INFO ] Dead Transitions using invariants and state equation in 9804 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2024-05-30 22:14:31] [INFO ] Computed 79 invariants in 1828 ms
[2024-05-30 22:14:31] [INFO ] Implicit Places using invariants in 1997 ms returned []
Implicit Place search using SMT only with invariants took 1998 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 88 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12092 ms. Remains : 540/540 places, 15470/17030 transitions.
Support contains 540 out of 540 places after structural reductions.
[2024-05-30 22:14:34] [INFO ] Flatten gal took : 1570 ms
[2024-05-30 22:14:43] [INFO ] Flatten gal took : 1553 ms
[2024-05-30 22:14:52] [INFO ] Input system was already deterministic with 15470 transitions.
Incomplete random walk after 10000 steps, including 1136 resets, run finished after 910 ms. (steps per millisecond=10 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Finished Best-First random walk after 277 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PhilosophersDyn-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(p0) U (!p1&&G(F(!p2)))))'
Support contains 500 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 4361 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:15:02] [INFO ] Invariant cache hit.
[2024-05-30 22:15:09] [INFO ] Dead Transitions using invariants and state equation in 6782 ms found 0 transitions.
[2024-05-30 22:15:09] [INFO ] Invariant cache hit.
[2024-05-30 22:15:09] [INFO ] Implicit Places using invariants in 177 ms returned []
Implicit Place search using SMT only with invariants took 178 ms to find 0 implicit places.
[2024-05-30 22:15:09] [INFO ] Invariant cache hit.
[2024-05-30 22:15:16] [INFO ] Dead Transitions using invariants and state equation in 7187 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18511 ms. Remains : 540/540 places, 15470/15470 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 323 ms :[(OR p1 p2), true, (NOT p0), p2, p2]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s47 1) (GEQ s113 1) (GEQ s116 1)) (AND (GEQ s55 1) (GEQ s313 1) (GEQ s476 1)) (AND (GEQ s185 1) (GEQ s343 1) (GEQ s531 1)) (AND (GEQ s182...], 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]]
Product exploration explored 100000 steps with 11939 reset in 6305 ms.
Stack based approach found an accepted trace after 13263 steps with 1571 reset with depth 6 and stack size 6 in 818 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-00 finished in 26703 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(G(p0)) U p1)))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 84 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:15:24] [INFO ] Invariant cache hit.
[2024-05-30 22:15:31] [INFO ] Dead Transitions using invariants and state equation in 7000 ms found 0 transitions.
[2024-05-30 22:15:31] [INFO ] Invariant cache hit.
[2024-05-30 22:15:31] [INFO ] Implicit Places using invariants in 704 ms returned []
Implicit Place search using SMT only with invariants took 705 ms to find 0 implicit places.
[2024-05-30 22:15:31] [INFO ] Invariant cache hit.
[2024-05-30 22:15:38] [INFO ] Dead Transitions using invariants and state equation in 6646 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14443 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (AND (GEQ s331 1) (GEQ s489 1)) (AND (GEQ s62 1) (GEQ s258 1)) (AND (GEQ s33 1) (GEQ s359 1)) (AND (GEQ s115 1) (GEQ s177 1)) (AND (GEQ s34 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-01 finished in 14660 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&&G(p2))||p0))||X((p1&&X(p3)))))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 96 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:15:38] [INFO ] Invariant cache hit.
[2024-05-30 22:15:45] [INFO ] Dead Transitions using invariants and state equation in 6616 ms found 0 transitions.
[2024-05-30 22:15:45] [INFO ] Invariant cache hit.
[2024-05-30 22:15:45] [INFO ] Implicit Places using invariants in 167 ms returned []
Implicit Place search using SMT only with invariants took 169 ms to find 0 implicit places.
[2024-05-30 22:15:45] [INFO ] Invariant cache hit.
[2024-05-30 22:15:52] [INFO ] Dead Transitions using invariants and state equation in 6633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13523 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), true, (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 9}], [{ cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(NOT p3), acceptance={} source=9 dest: 5}]], initial=7, aps=[p1:(OR (AND (GEQ s58 1) (GEQ s263 1) (GEQ s328 1) (GEQ s464 1)) (AND (GEQ s33 1) (GEQ s291 1) (GEQ s350 1) (GEQ s372 1)) (AND (GEQ s33 1) (GEQ s173 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-02 finished in 14207 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((G(p0)||G(p1))))'
Support contains 500 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 69 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:15:53] [INFO ] Invariant cache hit.
[2024-05-30 22:16:00] [INFO ] Dead Transitions using invariants and state equation in 7158 ms found 0 transitions.
[2024-05-30 22:16:00] [INFO ] Invariant cache hit.
[2024-05-30 22:16:00] [INFO ] Implicit Places using invariants in 202 ms returned []
Implicit Place search using SMT only with invariants took 203 ms to find 0 implicit places.
[2024-05-30 22:16:00] [INFO ] Invariant cache hit.
[2024-05-30 22:16:07] [INFO ] Dead Transitions using invariants and state equation in 6896 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14330 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (AND (GEQ s58 1) (GEQ s263 1) (GEQ s328 1) (GEQ s464 1)) (AND (GEQ s33 1) (GEQ s291 1) (GEQ s350 1) (GEQ s372 1)) (AND (GEQ s33 1) (GEQ s173 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 5 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-04 finished in 14784 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((F(p1)&&(G(!p2)||(!p2&&F(G(p1))))&&p0)))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 4271 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:16:12] [INFO ] Invariant cache hit.
[2024-05-30 22:16:18] [INFO ] Dead Transitions using invariants and state equation in 6447 ms found 0 transitions.
[2024-05-30 22:16:18] [INFO ] Invariant cache hit.
[2024-05-30 22:16:19] [INFO ] Implicit Places using invariants in 644 ms returned []
Implicit Place search using SMT only with invariants took 648 ms to find 0 implicit places.
[2024-05-30 22:16:19] [INFO ] Invariant cache hit.
[2024-05-30 22:16:26] [INFO ] Dead Transitions using invariants and state equation in 6919 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18287 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s129 1) (LT s208 1) (LT s379 1) (LT s483 1)) (OR (LT s0 1) (LT s133 1) (LT s474 1) (LT s475 1)) (OR (LT s87 1) (LT s146 1) (LT s177 1) (LT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 13490 steps with 1536 reset in 10004 ms.
Stack based approach found an accepted trace after 3141 steps with 361 reset with depth 10 and stack size 10 in 2398 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-05 finished in 30952 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' '!(((p0 U p1)||X(F((X(!p3)||p2)))))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 101 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:16:38] [INFO ] Invariant cache hit.
[2024-05-30 22:16:45] [INFO ] Dead Transitions using invariants and state equation in 7106 ms found 0 transitions.
[2024-05-30 22:16:45] [INFO ] Invariant cache hit.
[2024-05-30 22:16:46] [INFO ] Implicit Places using invariants in 210 ms returned []
Implicit Place search using SMT only with invariants took 211 ms to find 0 implicit places.
[2024-05-30 22:16:46] [INFO ] Invariant cache hit.
[2024-05-30 22:16:52] [INFO ] Dead Transitions using invariants and state equation in 6750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14170 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s331 1) (GEQ s489 1)) (AND (GEQ s62 1) (GEQ s258 1)) (AND (GEQ s33 1) (GEQ s359 1)) (AND (GEQ s115 1) (GEQ s177 1)) (AND (GEQ s34 1) (GEQ...], 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 timeout after 16250 steps with 8125 reset in 10005 ms.
Product exploration timeout after 16280 steps with 8140 reset in 10005 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 (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 29 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-20-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-20-LTLFireability-06 finished in 35410 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 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 5430 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:17:19] [INFO ] Invariant cache hit.
[2024-05-30 22:17:25] [INFO ] Dead Transitions using invariants and state equation in 6458 ms found 0 transitions.
[2024-05-30 22:17:25] [INFO ] Invariant cache hit.
[2024-05-30 22:17:28] [INFO ] Implicit Places using invariants in 2551 ms returned []
Implicit Place search using SMT only with invariants took 2553 ms to find 0 implicit places.
[2024-05-30 22:17:28] [INFO ] Invariant cache hit.
[2024-05-30 22:17:35] [INFO ] Dead Transitions using invariants and state equation in 6607 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21052 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s390 1) (GEQ s0 1) (GEQ s356 1) (GEQ s295 1) (GEQ s129 1) (GEQ s482 1) (GEQ s102 1) (GEQ s461 1) (GEQ s137 1) (GEQ s44 1) (GEQ s340 1) (GEQ s3...], 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 timeout after 84500 steps with 42250 reset in 10001 ms.
Product exploration timeout after 82600 steps with 41300 reset in 10001 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 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-PT-20-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-20-LTLFireability-07 finished in 41304 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 4 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 238 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:17:55] [INFO ] Invariant cache hit.
[2024-05-30 22:18:02] [INFO ] Dead Transitions using invariants and state equation in 6978 ms found 0 transitions.
[2024-05-30 22:18:02] [INFO ] Invariant cache hit.
[2024-05-30 22:18:05] [INFO ] Implicit Places using invariants in 2858 ms returned []
Implicit Place search using SMT only with invariants took 2859 ms to find 0 implicit places.
[2024-05-30 22:18:05] [INFO ] Invariant cache hit.
[2024-05-30 22:18:12] [INFO ] Dead Transitions using invariants and state equation in 6860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16936 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s157 1) (GEQ s271 1) (GEQ s291 1) (GEQ s340 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 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-08 finished in 17042 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((p0&&G(F(p1)))))'
Support contains 7 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 247 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:18:12] [INFO ] Invariant cache hit.
[2024-05-30 22:18:19] [INFO ] Dead Transitions using invariants and state equation in 6980 ms found 0 transitions.
[2024-05-30 22:18:19] [INFO ] Invariant cache hit.
[2024-05-30 22:18:22] [INFO ] Implicit Places using invariants in 2495 ms returned []
Implicit Place search using SMT only with invariants took 2496 ms to find 0 implicit places.
[2024-05-30 22:18:22] [INFO ] Invariant cache hit.
[2024-05-30 22:18:29] [INFO ] Dead Transitions using invariants and state equation in 6960 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16684 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s250 1) (LT s268 1) (LT s374 1)), p1:(AND (GEQ s208 1) (GEQ s308 1) (GEQ s379 1))], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-09 finished in 16860 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(G(p0))&&F(p1)))'
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 183 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:18:29] [INFO ] Invariant cache hit.
[2024-05-30 22:18:36] [INFO ] Dead Transitions using invariants and state equation in 6616 ms found 0 transitions.
[2024-05-30 22:18:36] [INFO ] Invariant cache hit.
[2024-05-30 22:18:38] [INFO ] Implicit Places using invariants in 2732 ms returned []
Implicit Place search using SMT only with invariants took 2734 ms to find 0 implicit places.
[2024-05-30 22:18:38] [INFO ] Invariant cache hit.
[2024-05-30 22:18:45] [INFO ] Dead Transitions using invariants and state equation in 6586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16121 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s147 1) (GEQ s173 1)), p1:(AND (GEQ s268 1) (GEQ s353 1) (GEQ s471 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-10 finished in 16285 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(p1))))'
Support contains 23 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 4541 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:18:50] [INFO ] Invariant cache hit.
[2024-05-30 22:18:56] [INFO ] Dead Transitions using invariants and state equation in 6157 ms found 0 transitions.
[2024-05-30 22:18:56] [INFO ] Invariant cache hit.
[2024-05-30 22:18:58] [INFO ] Implicit Places using invariants in 2156 ms returned []
Implicit Place search using SMT only with invariants took 2157 ms to find 0 implicit places.
[2024-05-30 22:18:58] [INFO ] Invariant cache hit.
[2024-05-30 22:19:05] [INFO ] Dead Transitions using invariants and state equation in 6922 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19783 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 724 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s42 1) (GEQ s72 1) (GEQ s154 1) (GEQ s156 1) (GEQ s192 1) (GEQ s212 1) (GEQ s214 1) (GEQ s263 1) (GEQ s286 1) (GEQ s304 1) (GEQ s307 1) (GEQ ...], 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]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-11 finished in 20552 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)) U (p1||(F(p2) U p0))))'
Support contains 8 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3407 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:19:09] [INFO ] Invariant cache hit.
[2024-05-30 22:19:15] [INFO ] Dead Transitions using invariants and state equation in 6319 ms found 0 transitions.
[2024-05-30 22:19:15] [INFO ] Invariant cache hit.
[2024-05-30 22:19:18] [INFO ] Implicit Places using invariants in 2614 ms returned []
Implicit Place search using SMT only with invariants took 2615 ms to find 0 implicit places.
[2024-05-30 22:19:18] [INFO ] Invariant cache hit.
[2024-05-30 22:19:24] [INFO ] Dead Transitions using invariants and state equation in 6225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18571 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s168 1) (GEQ s379 1)), p0:(AND (GEQ s282 1) (GEQ s361 1) (GEQ s518 1)), p2:(AND (GEQ s146 1) (GEQ s218 1) (GEQ s439 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-12 finished in 18683 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&&X((G(!p0)||F(!p1)))))) U (X(!p0)||F(p2))))'
Support contains 24 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 174 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:19:24] [INFO ] Invariant cache hit.
[2024-05-30 22:19:31] [INFO ] Dead Transitions using invariants and state equation in 6908 ms found 0 transitions.
[2024-05-30 22:19:31] [INFO ] Invariant cache hit.
[2024-05-30 22:19:33] [INFO ] Implicit Places using invariants in 1920 ms returned []
Implicit Place search using SMT only with invariants took 1921 ms to find 0 implicit places.
[2024-05-30 22:19:33] [INFO ] Invariant cache hit.
[2024-05-30 22:19:40] [INFO ] Dead Transitions using invariants and state equation in 6797 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15803 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s57 1), p0:(AND (GEQ s42 1) (GEQ s72 1) (GEQ s154 1) (GEQ s156 1) (GEQ s192 1) (GEQ s212 1) (GEQ s214 1) (GEQ s263 1) (GEQ s286 1) (GEQ s304 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 86320 steps with 43160 reset in 10001 ms.
Product exploration timeout after 83650 steps with 41825 reset in 10001 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 (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 27 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-20-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-20-LTLFireability-13 finished in 36248 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(((p0 U p1)||G(p2))))'
Support contains 8 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 232 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2024-05-30 22:20:01] [INFO ] Invariant cache hit.
[2024-05-30 22:20:08] [INFO ] Dead Transitions using invariants and state equation in 7160 ms found 0 transitions.
[2024-05-30 22:20:08] [INFO ] Invariant cache hit.
[2024-05-30 22:20:11] [INFO ] Implicit Places using invariants in 3145 ms returned []
Implicit Place search using SMT only with invariants took 3146 ms to find 0 implicit places.
[2024-05-30 22:20:11] [INFO ] Invariant cache hit.
[2024-05-30 22:20:17] [INFO ] Dead Transitions using invariants and state equation in 6145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16683 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s147 1) (GEQ s173 1)), p0:(AND (GEQ s138 1) (GEQ s355 1) (GEQ s537 1)), p2:(AND (GEQ s67 1) (GEQ s282 1) (GEQ s361 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLFireability-14 finished in 16856 ms.
All properties solved by simple procedures.
Total runtime 361546 ms.
BK_STOP 1717107618045
--------------------
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-PT-20"
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-PT-20, 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-171654460300038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-20.tgz
mv PhilosophersDyn-PT-20 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 '
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 ;