Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995900101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r140-tall-162298995900101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 22K May 5 16:51 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-00
FORMULA_NAME Philosophers-PT-000005-01
FORMULA_NAME Philosophers-PT-000005-02
FORMULA_NAME Philosophers-PT-000005-03
FORMULA_NAME Philosophers-PT-000005-04
FORMULA_NAME Philosophers-PT-000005-05
FORMULA_NAME Philosophers-PT-000005-06
FORMULA_NAME Philosophers-PT-000005-07
FORMULA_NAME Philosophers-PT-000005-08
FORMULA_NAME Philosophers-PT-000005-09
FORMULA_NAME Philosophers-PT-000005-10
FORMULA_NAME Philosophers-PT-000005-11
FORMULA_NAME Philosophers-PT-000005-12
FORMULA_NAME Philosophers-PT-000005-13
FORMULA_NAME Philosophers-PT-000005-14
FORMULA_NAME Philosophers-PT-000005-15

=== Now, execution of the tool begins

BK_START 1623004570891

Running Version 0
[2021-06-06 18:36:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-06 18:36:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 18:36:13] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-06-06 18:36:13] [INFO ] Transformed 25 places.
[2021-06-06 18:36:13] [INFO ] Transformed 25 transitions.
[2021-06-06 18:36:13] [INFO ] Found NUPN structural information;
[2021-06-06 18:36:13] [INFO ] Parsed PT model containing 25 places and 25 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 18:36:13] [INFO ] Initial state test concluded for 1 properties.
FORMULA Philosophers-PT-000005-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 188 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:14] [INFO ] Computed 10 place invariants in 7 ms
[2021-06-06 18:36:14] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:14] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-06 18:36:14] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:14] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:14] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
[2021-06-06 18:36:14] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-06-06 18:36:14] [INFO ] Flatten gal took : 41 ms
FORMULA Philosophers-PT-000005-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 18:36:14] [INFO ] Flatten gal took : 5 ms
[2021-06-06 18:36:14] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 32 steps, including 1 resets, run visited all 15 properties in 7 ms. (steps per millisecond=4 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((((p1 U p2)&&p0) U p3))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:14] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:14] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:14] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:14] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-06-06 18:36:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:14] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-06 18:36:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000005-01 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR p3 (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (OR (EQ s0 0) (EQ s5 0)) (OR (EQ s4 0) (EQ s9 0)) (OR (EQ s1 0) (EQ s6 0)) (OR (EQ s3 0) (EQ s8 0)) (OR (EQ s2 0) (EQ s7 0))), p0:(AND (EQ s19 0) (EQ s21 0) (EQ s22 0) (EQ s23 0) (EQ s24 0)), p2:(OR (EQ s19 1) (EQ s21 1) (EQ s22 1) (EQ s23 1) (EQ s24 1)), p1:(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)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13023 reset in 508 ms.
Stack based approach found an accepted trace after 156 steps with 23 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Philosophers-PT-000005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-01 finished in 1026 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((!p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:15] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:15] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:15] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-06 18:36:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:15] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-PT-000005-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (OR (NEQ s7 1) (NEQ s17 1)) (OR (NEQ s6 1) (NEQ s18 1)) (OR (NEQ s8 1) (NEQ s20 1)) (OR (NEQ s9 1) (NEQ s16 1)) (OR (NEQ s5 1) (NEQ s15 1))), p0:(OR (EQ s19 1) (EQ s21 1) (EQ s22 1) (EQ s23 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 15 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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.
[2021-06-06 18:36:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:19] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 284 ms.
[2021-06-06 18:36:20] [INFO ] Flatten gal took : 4 ms
[2021-06-06 18:36:20] [INFO ] Flatten gal took : 3 ms
[2021-06-06 18:36:20] [INFO ] Time to serialize gal into /tmp/LTL8383607640164831496.gal : 1 ms
[2021-06-06 18:36:20] [INFO ] Time to serialize properties into /tmp/LTL1828730956307532800.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8383607640164831496.gal, -t, CGAL, -LTL, /tmp/LTL1828730956307532800.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8383607640164831496.gal -t CGAL -LTL /tmp/LTL1828730956307532800.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((((((Fork_3==0)||(Catch2_4==0))&&((Fork_2==0)||(Catch2_3==0)))&&((Fork_4==0)||(Catch2_5==0)))&&((Fork_5==0)||(Catch2_1==0)))&&((Fork_1==0)||(Catch2_2==0)))"))||("(((((Eat_1==0)&&(Eat_3==0))&&(Eat_2==0))&&(Eat_5==0))&&(Eat_4==0))")))))
Formula 0 simplified : !XF("(((((Eat_1==0)&&(Eat_3==0))&&(Eat_2==0))&&(Eat_5==0))&&(Eat_4==0))" | G"((((((Fork_3==0)||(Catch2_4==0))&&((Fork_2==0)||(Catch2_3==0)))&&((Fork_4==0)||(Catch2_5==0)))&&((Fork_5==0)||(Catch2_1==0)))&&((Fork_1==0)||(Catch2_2==0)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.027602,16800,1,0,8,1772,30,3,659,697,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-PT-000005-02 finished in 4916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:36:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:20] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 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 : Philosophers-PT-000005-03 automaton TGBA [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 (EQ s19 1) (EQ s21 1) (EQ s22 1) (EQ s23 1) (EQ s24 1)), p1:(AND (OR (NEQ s4 1) (NEQ s8 1)) (OR (NEQ s1 1) (NEQ s5 1)) (OR (NEQ s3 1) (NEQ s7 1)) (OR (NEQ s2 1) (NEQ s6 1)) (OR (NEQ s0 1) (NEQ s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 Philosophers-PT-000005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-03 finished in 245 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:20] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-06-06 18:36:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:20] [INFO ] Computed 10 place invariants in 8 ms
[2021-06-06 18:36:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s19 1) (EQ s21 1) (EQ s22 1) (EQ s23 1) (EQ s24 1)), p0:(AND (OR (NEQ s4 1) (NEQ s8 1)) (OR (NEQ s1 1) (NEQ s5 1)) (OR (NEQ s3 1) (NEQ s7 1)) (OR (NEQ s2 1) (NEQ s6 1)) (OR (NEQ s0 1) (NEQ s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15624 reset in 138 ms.
Stack based approach found an accepted trace after 218 steps with 36 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Philosophers-PT-000005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-04 finished in 328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||G(p1)))||X(X(X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:21] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:21] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:21] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:21] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:21] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 1458 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000005-05 automaton TGBA [mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 10}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 12}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 12}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={} source=7 dest: 11}], [{ cond=p1, acceptance={} source=8 dest: 4}, { cond=(NOT p1), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 4}, { cond=p0, acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=true, acceptance={} source=11 dest: 12}], [{ cond=(NOT p2), acceptance={} source=12 dest: 10}, { cond=p2, acceptance={} source=12 dest: 12}]], initial=6, aps=[p1:(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))), p2:(OR (AND (NEQ s19 1) (NEQ s21 1) (NEQ s22 1) (NEQ s23 1) (NEQ s24 1)) (AND (OR (NEQ s0 1) (NEQ s5 1)) (OR (NEQ s4 1) (NEQ s9 1)) (OR (NEQ s1 1) (NEQ s6 1)) (OR (NEQ s3 1) (NEQ s8 1)) (OR (NEQ s2 1) (NEQ s7 1)))), p0:(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)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-05 finished in 1557 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0) U (!p1&&X(!p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:36:22] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:22] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:22] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-06 18:36:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:22] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 305 ms :[p1, true, p1, p0, p1]
Running random walk in product with property : Philosophers-PT-000005-06 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p1:(AND (OR (NEQ s7 1) (NEQ s17 1)) (OR (NEQ s6 1) (NEQ s18 1)) (OR (NEQ s8 1) (NEQ s20 1)) (OR (NEQ s9 1) (NEQ s16 1)) (OR (NEQ s5 1) (NEQ s15 1))), p0:(AND (OR (NEQ s4 1) (NEQ s8 1)) (OR (NEQ s1 1) (NEQ s5 1)) (OR (NEQ s3 1) (NEQ s7 1)) (OR (NEQ s2 1) (NEQ s6 1)) (OR (NEQ s0 1) (NEQ s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-06 finished in 380 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(!p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-06-06 18:36:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (NEQ s7 1) (NEQ s17 1)) (OR (NEQ s6 1) (NEQ s18 1)) (OR (NEQ s8 1) (NEQ s20 1)) (OR (NEQ s9 1) (NEQ s16 1)) (OR (NEQ s5 1) (NEQ s15 1))), p0:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s9 1) (EQ s13 1)) (AND (EQ s5 1) (EQ s10 1)) (AND (EQ s6 1) (EQ s11 1)) (AND (EQ s7 1) (EQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 112 steps with 9 reset in 1 ms.
FORMULA Philosophers-PT-000005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-07 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p1))||p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000005-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s2 1) (NEQ s6 1)), p1:(AND (EQ s2 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 2 reset in 0 ms.
FORMULA Philosophers-PT-000005-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-08 finished in 212 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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 7 ms. Remains 22 /25 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-06-06 18:36:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 22/25 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s6 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 26994 reset in 110 ms.
Stack based approach found an accepted trace after 57 steps with 17 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Philosophers-PT-000005-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-11 finished in 233 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 23
Applied a total of 4 rules in 5 ms. Remains 23 /25 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-06-06 18:36:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-06-06 18:36:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:23] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/25 places, 23/25 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s22 1) (AND (EQ s6 1) (EQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 45 steps with 7 reset in 1 ms.
FORMULA Philosophers-PT-000005-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-12 finished in 301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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 1 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 5 ms. Remains 22 /25 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:24] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:24] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-06-06 18:36:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:24] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:24] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 22/25 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s0 1) (NEQ s9 1) (AND (EQ s9 1) (EQ s13 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 30744 reset in 94 ms.
Stack based approach found an accepted trace after 7 steps with 2 reset with depth 2 and stack size 2 in 1 ms.
FORMULA Philosophers-PT-000005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-13 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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 5 ms. Remains 22 /25 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:24] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-06-06 18:36:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-06-06 18:36:24] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 22/25 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s14 1)), p0:(OR (EQ s4 0) (EQ s8 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27077 reset in 121 ms.
Stack based approach found an accepted trace after 16 steps with 6 reset with depth 2 and stack size 2 in 0 ms.
FORMULA Philosophers-PT-000005-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-14 finished in 389 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623004602748

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-4028"
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 r140-tall-162298995900101"
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 ;