Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945100188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Philosophers-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945100188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.0K Feb 25 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 22K Mar 5 18:23 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 Philosophers-PT-000005-LTLFireability-00
FORMULA_NAME Philosophers-PT-000005-LTLFireability-01
FORMULA_NAME Philosophers-PT-000005-LTLFireability-02
FORMULA_NAME Philosophers-PT-000005-LTLFireability-03
FORMULA_NAME Philosophers-PT-000005-LTLFireability-04
FORMULA_NAME Philosophers-PT-000005-LTLFireability-05
FORMULA_NAME Philosophers-PT-000005-LTLFireability-06
FORMULA_NAME Philosophers-PT-000005-LTLFireability-07
FORMULA_NAME Philosophers-PT-000005-LTLFireability-08
FORMULA_NAME Philosophers-PT-000005-LTLFireability-09
FORMULA_NAME Philosophers-PT-000005-LTLFireability-10
FORMULA_NAME Philosophers-PT-000005-LTLFireability-11
FORMULA_NAME Philosophers-PT-000005-LTLFireability-12
FORMULA_NAME Philosophers-PT-000005-LTLFireability-13
FORMULA_NAME Philosophers-PT-000005-LTLFireability-14
FORMULA_NAME Philosophers-PT-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678805511068

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000005
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 14:51:52] [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]
[2023-03-14 14:51:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:51:52] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-14 14:51:52] [INFO ] Transformed 25 places.
[2023-03-14 14:51:52] [INFO ] Transformed 25 transitions.
[2023-03-14 14:51:52] [INFO ] Found NUPN structural information;
[2023-03-14 14:51:52] [INFO ] Parsed PT model containing 25 places and 25 transitions and 80 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-PT-000005-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-14 14:51:52] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-14 14:51:53] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-14 14:51:53] [INFO ] Invariant cache hit.
[2023-03-14 14:51:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-14 14:51:53] [INFO ] Invariant cache hit.
[2023-03-14 14:51:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 25/25 places, 25/25 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-14 14:51:53] [INFO ] Flatten gal took : 16 ms
[2023-03-14 14:51:53] [INFO ] Flatten gal took : 5 ms
[2023-03-14 14:51:53] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 75 steps, including 3 resets, run visited all 23 properties in 18 ms. (steps per millisecond=4 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:53] [INFO ] Invariant cache hit.
[2023-03-14 14:51:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 14:51:53] [INFO ] Invariant cache hit.
[2023-03-14 14:51:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-14 14:51:53] [INFO ] Invariant cache hit.
[2023-03-14 14:51: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 108 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s4 0) (EQ s8 0)) (OR (EQ s1 0) (EQ s5 0)) (OR (EQ s3 0) (EQ s7 0)) (OR (EQ s2 0) (EQ s6 0)) (OR (EQ s0 0) (EQ s9 0)))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA Philosophers-PT-000005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-00 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(F(p1)))))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:54] [INFO ] Invariant cache hit.
[2023-03-14 14:51:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 14:51:54] [INFO ] Invariant cache hit.
[2023-03-14 14:51:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-14 14:51:54] [INFO ] Invariant cache hit.
[2023-03-14 14:51:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (OR (AND (EQ s0 1) (EQ s5 1)) (AND (EQ s4 1) (EQ s9 1)) (AND (EQ s1 1) (EQ s6 1)) (AND (EQ s3 1) (EQ s8 1)) (AND (EQ s2 1) (EQ s7 1))) (OR (EQ s19...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 25796 reset in 233 ms.
Product exploration explored 100000 steps with 25808 reset in 172 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 p0) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:55] [INFO ] Invariant cache hit.
[2023-03-14 14:51:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 14:51:55] [INFO ] Invariant cache hit.
[2023-03-14 14:51:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-14 14:51:55] [INFO ] Invariant cache hit.
[2023-03-14 14:51:55] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 25/25 places, 25/25 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 : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25798 reset in 221 ms.
Product exploration explored 100000 steps with 25803 reset in 132 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:51:57] [INFO ] Invariant cache hit.
[2023-03-14 14:51:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 25/25 places, 25/25 transitions.
Built C files in :
/tmp/ltsmin2592905256737896203
[2023-03-14 14:51:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2592905256737896203
Running compilation step : cd /tmp/ltsmin2592905256737896203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin2592905256737896203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2592905256737896203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4344531377798756633.hoa' '--buchi-type=spotba'
LTSmin run took 233 ms.
FORMULA Philosophers-PT-000005-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000005-LTLFireability-04 finished in 3429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(p1 U p2)))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:57] [INFO ] Invariant cache hit.
[2023-03-14 14:51:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 14:51:57] [INFO ] Invariant cache hit.
[2023-03-14 14:51:57] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-14 14:51:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:51:57] [INFO ] Invariant cache hit.
[2023-03-14 14:51:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s19 1) (EQ s21 1) (EQ s22 1) (EQ s23 1) (EQ s24 1)), p2:(AND (OR (AND (EQ s0 1) (EQ s5 1)) (AND (EQ s4 1) (EQ s9 1)) (AND (EQ s1 1) (EQ s6 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 153 steps with 20 reset in 4 ms.
FORMULA Philosophers-PT-000005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-05 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1)&&F(p2))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:57] [INFO ] Invariant cache hit.
[2023-03-14 14:51:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 14:51:57] [INFO ] Invariant cache hit.
[2023-03-14 14:51:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-14 14:51:57] [INFO ] Invariant cache hit.
[2023-03-14 14:51:57] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(OR (AND (EQ s7 1) (EQ s17 1)) (AND (EQ s6 1) (EQ s18 1)) (AND (EQ s8 1) (EQ s20 1)) (AND (EQ s9 1) (EQ s16 1)) (AND (EQ s5 1) (EQ s15 1))), p1:(OR (EQ...], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 4 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-06 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:58] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-14 14:51:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (EQ s8 0) (EQ s14 0)) (OR (EQ s9 0) (EQ s13 0)) (OR (EQ s5 0) (EQ s10 0)) (OR (EQ s6 0) (EQ s11 0)) (OR (EQ s7 0) (EQ s12 0))), p0:(AND (OR (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9660 reset in 185 ms.
Stack based approach found an accepted trace after 2604 steps with 262 reset with depth 6 and stack size 6 in 5 ms.
FORMULA Philosophers-PT-000005-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-07 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U (G((p2||X(p3)))&&p1))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s9 1)), p2:(AND (EQ s9 1) (EQ s13 1)), p0:(AND (EQ s7 1) (EQ s12 1)), p3:(AND (EQ s3 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 1 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-08 finished in 383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 24
Applied a total of 2 rules in 5 ms. Remains 24 /25 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-14 14:51:58] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-14 14:51:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-14 14:51:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:51:58] [INFO ] Invariant cache hit.
[2023-03-14 14:51:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/25 places, 24/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 24/25 places, 24/25 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-09 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 (NEQ s3 1) (NEQ s8 1)) (OR (NEQ s1 1) (NEQ s6 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 2949 reset in 200 ms.
Stack based approach found an accepted trace after 22 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-09 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((F(!p0)&&F(!p1)))||(p2&&F(!p0)&&F(!p1)))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-14 14:51:59] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-14 14:51:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 14:51:59] [INFO ] Invariant cache hit.
[2023-03-14 14:51:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-14 14:51:59] [INFO ] Invariant cache hit.
[2023-03-14 14:51:59] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), p1, p0]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s23 1), p1:(AND (EQ s6 1) (EQ s11 1)), p0:(AND (EQ s5 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26700 reset in 131 ms.
Stack based approach found an accepted trace after 341 steps with 93 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-10 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 24
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-14 14:51:59] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-14 14:51:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 14:51:59] [INFO ] Invariant cache hit.
[2023-03-14 14:51:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-14 14:51:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:51:59] [INFO ] Invariant cache hit.
[2023-03-14 14:51:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/25 places, 24/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 24/25 places, 24/25 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s2 1) (NEQ s7 1)) (OR (NEQ s0 1) (NEQ s9 1))), p1:(OR (EQ s2 0) (EQ s7 0))], nbAcceptance=2, 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 2924 reset in 165 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-11 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 24
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-14 14:52:00] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-14 14:52:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 14:52:00] [INFO ] Invariant cache hit.
[2023-03-14 14:52:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-14 14:52:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:52:00] [INFO ] Invariant cache hit.
[2023-03-14 14:52:00] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/25 places, 24/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 24/25 places, 24/25 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s8 1) (EQ s20 1)), p0:(AND (EQ s1 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 78 steps with 5 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-12 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 22
Applied a total of 6 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-14 14:52:00] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-14 14:52:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 14:52:00] [INFO ] Invariant cache hit.
[2023-03-14 14:52:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-14 14:52:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:52:00] [INFO ] Invariant cache hit.
[2023-03-14 14:52:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/25 places, 22/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 22/25 places, 22/25 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s9 1) (NEQ s16 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 3351 reset in 111 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-14 finished in 261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-14 14:52:00] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-14 14:52:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 14:52:00] [INFO ] Invariant cache hit.
[2023-03-14 14:52:00] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-14 14:52:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:52:00] [INFO ] Invariant cache hit.
[2023-03-14 14:52:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (NOT (AND (EQ s6 1) (EQ s11 1))) (NOT (AND (EQ s9 1) (EQ s16 1)))), p1:(AND (EQ s6 1) (EQ s11 1)), p0:(AND (EQ s8 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-15 finished in 241 ms.
All properties solved by simple procedures.
Total runtime 8426 ms.

BK_STOP 1678805521880

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="Philosophers-PT-000005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000005, 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 r293-tall-167873945100188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 ;