Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267700005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 PhilosophersDyn-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267700005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 31K 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 PhilosophersDyn-COL-03-00
FORMULA_NAME PhilosophersDyn-COL-03-01
FORMULA_NAME PhilosophersDyn-COL-03-02
FORMULA_NAME PhilosophersDyn-COL-03-03
FORMULA_NAME PhilosophersDyn-COL-03-04
FORMULA_NAME PhilosophersDyn-COL-03-05
FORMULA_NAME PhilosophersDyn-COL-03-06
FORMULA_NAME PhilosophersDyn-COL-03-07
FORMULA_NAME PhilosophersDyn-COL-03-08
FORMULA_NAME PhilosophersDyn-COL-03-09
FORMULA_NAME PhilosophersDyn-COL-03-10
FORMULA_NAME PhilosophersDyn-COL-03-11
FORMULA_NAME PhilosophersDyn-COL-03-12
FORMULA_NAME PhilosophersDyn-COL-03-13
FORMULA_NAME PhilosophersDyn-COL-03-14
FORMULA_NAME PhilosophersDyn-COL-03-15

=== Now, execution of the tool begins

BK_START 1621176436529

Running Version 0
[2021-05-16 14:47:20] [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-05-16 14:47:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:47:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-16 14:47:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 14:47:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2021-05-16 14:47:21] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
FORMULA PhilosophersDyn-COL-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:47:21] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions in 3 ms.
[2021-05-16 14:47:21] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_2423883332956507086.dot
[2021-05-16 14:47:21] [INFO ] Initial state test concluded for 1 properties.
FORMULA PhilosophersDyn-COL-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-16 14:47:21] [INFO ] Flatten gal took : 20 ms
[2021-05-16 14:47:21] [INFO ] Flatten gal took : 7 ms
[2021-05-16 14:47:21] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 6 ms.
[2021-05-16 14:47:21] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13037634636710296479.dot
[2021-05-16 14:47:21] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 14:47:21] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 14:47:21] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 14:47:21] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 14:47:21] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 14:47:21] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 14:47:21] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-16 14:47:21] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 78 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-16 14:47:22] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 14:47:22] [INFO ] Computed 11 place invariants in 19 ms
[2021-05-16 14:47:22] [INFO ] Dead Transitions using invariants and state equation in 451 ms returned [3, 6, 7, 9, 11, 12, 13, 16, 19, 20, 21, 23, 25, 26, 29, 30, 33, 34, 36, 38, 39, 40, 43, 46, 47, 48, 50, 52, 53, 56]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[56, 53, 52, 50, 48, 47, 46, 43, 40, 39, 38, 36, 34, 33, 30, 29, 26, 25, 23, 21, 20, 19, 16, 13, 12, 11, 9, 7, 6, 3]
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:22] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 14:47:22] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:22] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 14:47:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:22] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:22] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:22] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:22] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:23] [INFO ] Dead Transitions using invariants and state equation in 819 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/30 places, 51/81 transitions.
[2021-05-16 14:47:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 14:47:23] [INFO ] Flatten gal took : 46 ms
FORMULA PhilosophersDyn-COL-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:47:23] [INFO ] Flatten gal took : 28 ms
[2021-05-16 14:47:24] [INFO ] Input system was already deterministic with 51 transitions.
Finished random walk after 97 steps, including 15 resets, run visited all 11 properties in 3 ms. (steps per millisecond=32 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((p1&&X((G(!p1)&&F(G(p2))))))||p0)))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:24] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:24] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:24] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:24] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:24] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:24] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:24] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-03-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s5 1) (GEQ s17 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s4 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s21 1))), p1:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s5 1) (GEQ s17 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s4 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s21 1))), p2:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s7 1) (LT s14 1) (LT s17 1)) (OR (LT s0 2) (LT s12 1) (LT s15 1)) (OR (LT s1 1) (LT s3 1) (LT s13 1) (LT s16 1)) (OR (LT s0 1) (LT s1 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s6 1) (LT s14 1) (LT s17 1)) (OR (LT s1 1) (LT s5 1) (LT s13 1) (LT s16 1)) (OR (LT s4 2) (LT s13 1) (LT s16 1)) (OR (LT s5 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s2 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s5 1) (LT s6 1) (LT s14 1) (LT s17 1)) (OR (LT s4 1) (LT s5 1) (LT s13 1) (LT s16 1)) (OR (LT s0 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s2 1) (LT s7 1) (LT s14 1) (LT s17 1)) (OR (LT s1 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s1 1) (LT s4 1) (LT s13 1) (LT s16 1)) (OR (LT s3 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s7 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s3 1) (LT s4 1) (LT s13 1) (LT s16 1)) (OR (LT s6 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s4 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s1 1) (LT s3 1) (LT s12 1) (LT s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 20 reset in 3 ms.
FORMULA PhilosophersDyn-COL-03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-00 finished in 950 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 18 ms
[2021-05-16 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:25] [INFO ] Implicit Places using invariants in 577 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:25] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2021-05-16 14:47:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-01 finished in 845 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:25] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-02 finished in 1627 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 18 ms
[2021-05-16 14:47:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2021-05-16 14:47:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ 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 23 steps with 5 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-03 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s7 1) (LT s14 1) (LT s17 1)) (OR (LT s0 2) (LT s12 1) (LT s15 1)) (OR (LT s1 1) (LT s3 1) (LT s13 1) (LT s16 1)) (OR (LT s0 1) (LT s1 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s6 1) (LT s14 1) (LT s17 1)) (OR (LT s1 1) (LT s5 1) (LT s13 1) (LT s16 1)) (OR (LT s4 2) (LT s13 1) (LT s16 1)) (OR (LT s5 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s2 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s5 1) (LT s6 1) (LT s14 1) (LT s17 1)) (OR (LT s4 1) (LT s5 1) (LT s13 1) (LT s16 1)) (OR (LT s0 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s2 1) (LT s7 1) (LT s14 1) (LT s17 1)) (OR (LT s1 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s1 1) (LT s4 1) (LT s13 1) (LT s16 1)) (OR (LT s3 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s7 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s3 1) (LT s4 1) (LT s13 1) (LT s16 1)) (OR (LT s6 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s4 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s1 1) (LT s3 1) (LT s12 1) (LT s15 1))), p0:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s5 1) (GEQ s17 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s4 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 18 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
[2021-05-16 14:47:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Product exploration explored 100000 steps with 50000 reset in 462 ms.
[2021-05-16 14:47:30] [INFO ] Flatten gal took : 19 ms
[2021-05-16 14:47:30] [INFO ] Flatten gal took : 5 ms
[2021-05-16 14:47:30] [INFO ] Time to serialize gal into /tmp/LTL12733590059001848760.gal : 11 ms
[2021-05-16 14:47:30] [INFO ] Time to serialize properties into /tmp/LTL11737265490217935130.ltl : 3 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/LTL12733590059001848760.gal, -t, CGAL, -LTL, /tmp/LTL11737265490217935130.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/LTL12733590059001848760.gal -t CGAL -LTL /tmp/LTL11737265490217935130.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((((((((((((((((((((((((((((((Neighbourhood_2<1)||(Neighbourhood_3<1))||(Think_0<1))||(Forks_0<1))&&(((Neighbourhood_8<2)||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_3<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_7<1))||(Think_2<1))||(Forks_2<1)))&&(((Neighbourhood_0<2)||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_3<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_1<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_6<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_5<1))||(Think_1<1))||(Forks_1<1)))&&(((Neighbourhood_4<2)||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_2<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_6<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_4<1)||(Neighbourhood_5<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_6<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_7<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_7<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_6<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_6<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_4<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_3<1)||(Neighbourhood_7<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_7<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_3<1)||(Neighbourhood_4<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_6<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_4<1)||(Neighbourhood_7<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_3<1))||(Think_0<1))||(Forks_0<1)))"))||("(((((((((((Neighbourhood_6<1)||(Forks_0<1))||(WaitRight_2<1))&&(((Neighbourhood_3<1)||(Forks_0<1))||(WaitRight_1<1)))&&(((Neighbourhood_1<1)||(Forks_1<1))||(WaitRight_0<1)))&&(((Neighbourhood_8<1)||(Forks_2<1))||(WaitRight_2<1)))&&(((Neighbourhood_5<1)||(Forks_2<1))||(WaitRight_1<1)))&&(((Neighbourhood_2<1)||(Forks_2<1))||(WaitRight_0<1)))&&(((Neighbourhood_4<1)||(Forks_1<1))||(WaitRight_1<1)))&&(((Neighbourhood_7<1)||(Forks_1<1))||(WaitRight_2<1)))&&(((Neighbourhood_0<1)||(Forks_0<1))||(WaitRight_0<1)))"))))
Formula 0 simplified : !X("(((((((((((Neighbourhood_6<1)||(Forks_0<1))||(WaitRight_2<1))&&(((Neighbourhood_3<1)||(Forks_0<1))||(WaitRight_1<1)))&&(((Neighbourhood_1<1)||(Forks_1<1))||(WaitRight_0<1)))&&(((Neighbourhood_8<1)||(Forks_2<1))||(WaitRight_2<1)))&&(((Neighbourhood_5<1)||(Forks_2<1))||(WaitRight_1<1)))&&(((Neighbourhood_2<1)||(Forks_2<1))||(WaitRight_0<1)))&&(((Neighbourhood_4<1)||(Forks_1<1))||(WaitRight_1<1)))&&(((Neighbourhood_7<1)||(Forks_1<1))||(WaitRight_2<1)))&&(((Neighbourhood_0<1)||(Forks_0<1))||(WaitRight_0<1)))" | F"((((((((((((((((((((((((((((((Neighbourhood_2<1)||(Neighbourhood_3<1))||(Think_0<1))||(Forks_0<1))&&(((Neighbourhood_8<2)||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_3<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_7<1))||(Think_2<1))||(Forks_2<1)))&&(((Neighbourhood_0<2)||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_3<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_1<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_6<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_5<1))||(Think_1<1))||(Forks_1<1)))&&(((Neighbourhood_4<2)||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_2<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_6<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_4<1)||(Neighbourhood_5<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_0<1)||(Neighbourhood_6<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_5<1)||(Neighbourhood_7<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_7<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_6<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_2<1)||(Neighbourhood_6<1))||(Think_0<1))||(Forks_0<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_4<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_3<1)||(Neighbourhood_7<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_7<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_3<1)||(Neighbourhood_4<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_6<1)||(Neighbourhood_8<1))||(Think_2<1))||(Forks_2<1)))&&((((Neighbourhood_4<1)||(Neighbourhood_7<1))||(Think_1<1))||(Forks_1<1)))&&((((Neighbourhood_1<1)||(Neighbourhood_3<1))||(Think_0<1))||(Forks_0<1)))")
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
7 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.29868,19196,1,0,99,12046,117,42,1962,8285,104
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PhilosophersDyn-COL-03-04 finished in 2995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:30] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:30] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:31] [INFO ] Implicit Places using invariants in 1002 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:32] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, p0, p0]
Running random walk in product with property : PhilosophersDyn-COL-03-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 14365 reset in 260 ms.
Product exploration explored 100000 steps with 14301 reset in 211 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 97 ms :[true, p0, p0]
Product exploration explored 100000 steps with 14314 reset in 117 ms.
Product exploration explored 100000 steps with 14309 reset in 192 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, p0, p0]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:33] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:33] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
[2021-05-16 14:47:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:34] [INFO ] Dead Transitions using invariants and state equation in 722 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 14356 reset in 203 ms.
Product exploration explored 100000 steps with 14234 reset in 125 ms.
[2021-05-16 14:47:35] [INFO ] Flatten gal took : 14 ms
[2021-05-16 14:47:35] [INFO ] Flatten gal took : 5 ms
[2021-05-16 14:47:35] [INFO ] Time to serialize gal into /tmp/LTL18163344185799976527.gal : 2 ms
[2021-05-16 14:47:35] [INFO ] Time to serialize properties into /tmp/LTL18405456387640924901.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/LTL18163344185799976527.gal, -t, CGAL, -LTL, /tmp/LTL18405456387640924901.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/LTL18163344185799976527.gal -t CGAL -LTL /tmp/LTL18405456387640924901.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("(((Outside_0<1)||(Outside_1<1))||(Outside_2<1))"))))
Formula 0 simplified : !XG"(((Outside_0<1)||(Outside_1<1))||(Outside_2<1))"
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22 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.242267,19556,1,0,111,15184,116,59,1818,14685,141
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PhilosophersDyn-COL-03-06 finished in 4566 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U (X(G(!p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:35] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:35] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:35] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:35] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) p2), p2, (OR (NOT p1) p2), p2]
Running random walk in product with property : PhilosophersDyn-COL-03-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=3 dest: 0}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={1} source=3 dest: 0}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s12 1) (LT s13 1) (LT s14 1)), p0:(OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 1)), p2:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s5 1) (GEQ s17 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s4 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s21 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14355 reset in 390 ms.
Stack based approach found an accepted trace after 285 steps with 43 reset with depth 6 and stack size 6 in 1 ms.
FORMULA PhilosophersDyn-COL-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-08 finished in 912 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F((G(p2)||p1)))||p0)))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:38] [INFO ] Dead Transitions using invariants and state equation in 2352 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:38] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:38] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-03-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (LT s9 1) (LT s10 1) (LT s11 1)), p2:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p1:(OR (AND (GEQ s2 1) (GEQ s3 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s8 2) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s5 1) (GEQ s7 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s0 2) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s1 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s4 2) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s5 1) (GEQ s8 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s2 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s6 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s5 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s5 1) (GEQ s7 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s7 1) (GEQ s8 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s4 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s8 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s7 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s12 1) (GEQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 18 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:40] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
[2021-05-16 14:47:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
[2021-05-16 14:47:40] [INFO ] Flatten gal took : 4 ms
[2021-05-16 14:47:40] [INFO ] Flatten gal took : 3 ms
[2021-05-16 14:47:40] [INFO ] Time to serialize gal into /tmp/LTL10840785083617536092.gal : 1 ms
[2021-05-16 14:47:40] [INFO ] Time to serialize properties into /tmp/LTL14076247247979034813.ltl : 1 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/LTL10840785083617536092.gal, -t, CGAL, -LTL, /tmp/LTL14076247247979034813.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/LTL10840785083617536092.gal -t CGAL -LTL /tmp/LTL14076247247979034813.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((Outside_0<1)||(Outside_1<1))||(Outside_2<1))")||(G(F(("((((((((((((((((((((((((((((((Neighbourhood_2>=1)&&(Neighbourhood_3>=1))&&(Think_0>=1))&&(Forks_0>=1))||(((Neighbourhood_8>=2)&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_3>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_7>=1))&&(Think_2>=1))&&(Forks_2>=1)))||(((Neighbourhood_0>=2)&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_3>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_1>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_6>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_5>=1))&&(Think_1>=1))&&(Forks_1>=1)))||(((Neighbourhood_4>=2)&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_2>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_6>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_4>=1)&&(Neighbourhood_5>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_6>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_7>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_7>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_6>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_6>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_4>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_3>=1)&&(Neighbourhood_7>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_7>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_3>=1)&&(Neighbourhood_4>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_6>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_4>=1)&&(Neighbourhood_7>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_3>=1))&&(Think_0>=1))&&(Forks_0>=1)))")||(G("(((Outside_0>=1)&&(Outside_1>=1))&&(Outside_2>=1))"))))))))
Formula 0 simplified : !X("(((Outside_0<1)||(Outside_1<1))||(Outside_2<1))" | GF("((((((((((((((((((((((((((((((Neighbourhood_2>=1)&&(Neighbourhood_3>=1))&&(Think_0>=1))&&(Forks_0>=1))||(((Neighbourhood_8>=2)&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_3>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_7>=1))&&(Think_2>=1))&&(Forks_2>=1)))||(((Neighbourhood_0>=2)&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_3>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_1>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_6>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_5>=1))&&(Think_1>=1))&&(Forks_1>=1)))||(((Neighbourhood_4>=2)&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_2>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_6>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_4>=1)&&(Neighbourhood_5>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_0>=1)&&(Neighbourhood_6>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_5>=1)&&(Neighbourhood_7>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_7>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_6>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_2>=1)&&(Neighbourhood_6>=1))&&(Think_0>=1))&&(Forks_0>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_4>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_3>=1)&&(Neighbourhood_7>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_7>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_3>=1)&&(Neighbourhood_4>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_6>=1)&&(Neighbourhood_8>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Neighbourhood_4>=1)&&(Neighbourhood_7>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_1>=1)&&(Neighbourhood_3>=1))&&(Think_0>=1))&&(Forks_0>=1)))" | G"(((Outside_0>=1)&&(Outside_1>=1))&&(Outside_2>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6 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.085092,20048,1,0,99,12044,120,42,1944,8288,106
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PhilosophersDyn-COL-03-09 finished in 4310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 15 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 12 ms
[2021-05-16 14:47:40] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2021-05-16 14:47:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s8 2) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s7 1) (LT s14 1) (LT s17 1)) (OR (LT s0 2) (LT s12 1) (LT s15 1)) (OR (LT s1 1) (LT s3 1) (LT s13 1) (LT s16 1)) (OR (LT s0 1) (LT s1 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s6 1) (LT s14 1) (LT s17 1)) (OR (LT s1 1) (LT s5 1) (LT s13 1) (LT s16 1)) (OR (LT s4 2) (LT s13 1) (LT s16 1)) (OR (LT s5 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s0 1) (LT s2 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s5 1) (LT s6 1) (LT s14 1) (LT s17 1)) (OR (LT s4 1) (LT s5 1) (LT s13 1) (LT s16 1)) (OR (LT s0 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s2 1) (LT s7 1) (LT s14 1) (LT s17 1)) (OR (LT s1 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s1 1) (LT s4 1) (LT s13 1) (LT s16 1)) (OR (LT s3 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s7 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s3 1) (LT s4 1) (LT s13 1) (LT s16 1)) (OR (LT s6 1) (LT s8 1) (LT s14 1) (LT s17 1)) (OR (LT s4 1) (LT s7 1) (LT s13 1) (LT s16 1)) (OR (LT s1 1) (LT s3 1) (LT s12 1) (LT s15 1))), p1:(OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 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]]
Stuttering criterion allowed to conclude after 19 steps with 5 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-10 finished in 328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:41] [INFO ] Dead Transitions using invariants and state equation in 539 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:41] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2021-05-16 14:47:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:42] [INFO ] Dead Transitions using invariants and state equation in 909 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1))), p0:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s15 2)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s16 2)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s17 2)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s15 2)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s9 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s17 2)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s15 2)) (AND (GEQ s6 1) (GEQ s11 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s9 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s9 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s4 1) (GEQ s11 1) (GEQ s16 2)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s15 1) (GEQ s16 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 6 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-11 finished in 1672 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0&&G(p1)&&(p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:42] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:42] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:42] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:42] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:42] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:42] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : PhilosophersDyn-COL-03-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p2:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s15 2)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s16 2)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s17 2)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s15 2)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s9 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s17 2)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s15 2)) (AND (GEQ s6 1) (GEQ s11 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s9 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s9 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s4 1) (GEQ s11 1) (GEQ s16 2)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s15 1) (GEQ s16 1))), p0:(OR (AND (GEQ s2 1) (GEQ s24 1) (GEQ s27 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s28 1)) (AND (GEQ s6 1) (GEQ s26 1) (GEQ s29 1)) (AND (GEQ s8 1) (GEQ s26 1) (GEQ s29 1)) (AND (GEQ s4 1) (GEQ s25 1) (GEQ s28 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s27 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s27 1)) (AND (GEQ s5 1) (GEQ s25 1) (GEQ s28 1)) (AND (GEQ s7 1) (GEQ s26 1) (GEQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 3 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-12 finished in 660 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((!p0 U (G((!p0||X((X(G(!p1))||G(p1)))))||(G(!p2)&&(!p0||X((X(G(!p1))||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:43] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:43] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:43] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 433 ms :[false, false, false, true, false, false, false, p1, (AND p1 p2), (NOT p1), p2, (AND (NOT p1) p2)]
Running random walk in product with property : PhilosophersDyn-COL-03-13 automaton TGBA [mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}, { cond=p1, acceptance={} source=5 dest: 9}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND p2 p1), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 11}], [{ cond=p1, acceptance={} source=7 dest: 3}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 10}], [{ cond=(NOT p1), acceptance={} source=9 dest: 3}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 3}, { cond=(NOT p2), acceptance={} source=10 dest: 10}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 3}, { cond=(AND p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 11}]], initial=1, aps=[p2:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s16 2)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s17 2)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s15 2)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s16 2)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s10 1) (GEQ s17 2)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s15 2)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s9 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s17 2)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s15 2)) (AND (GEQ s6 1) (GEQ s11 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s9 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s9 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s4 1) (GEQ s11 1) (GEQ s16 2)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s15 1) (GEQ s16 1))), p1:(OR (AND (GEQ s6 1) (GEQ s15 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s5 1) (GEQ s17 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s4 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s21 1))), p0:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 7 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-13 finished in 640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:44] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:44] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:44] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2021-05-16 14:47:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:44] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-15 finished in 348 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621176464785

--------------------
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="PhilosophersDyn-COL-03"
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 PhilosophersDyn-COL-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089267700005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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