About the Execution of ITS-Tools for PhilosophersDyn-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 379.319 | 10445.00 | 22404.00 | 82.60 | TFTFFTFTFFFFFTFF | normal |
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-162089267800044.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-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 30K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 172K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 299K 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 5.0K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 87K 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-PT-03-00
FORMULA_NAME PhilosophersDyn-PT-03-01
FORMULA_NAME PhilosophersDyn-PT-03-02
FORMULA_NAME PhilosophersDyn-PT-03-03
FORMULA_NAME PhilosophersDyn-PT-03-04
FORMULA_NAME PhilosophersDyn-PT-03-05
FORMULA_NAME PhilosophersDyn-PT-03-06
FORMULA_NAME PhilosophersDyn-PT-03-07
FORMULA_NAME PhilosophersDyn-PT-03-08
FORMULA_NAME PhilosophersDyn-PT-03-09
FORMULA_NAME PhilosophersDyn-PT-03-10
FORMULA_NAME PhilosophersDyn-PT-03-11
FORMULA_NAME PhilosophersDyn-PT-03-12
FORMULA_NAME PhilosophersDyn-PT-03-13
FORMULA_NAME PhilosophersDyn-PT-03-14
FORMULA_NAME PhilosophersDyn-PT-03-15
=== Now, execution of the tool begins
BK_START 1621179210484
Running Version 0
[2021-05-16 15:33:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 15:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:33:32] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-16 15:33:32] [INFO ] Transformed 30 places.
[2021-05-16 15:33:32] [INFO ] Transformed 84 transitions.
[2021-05-16 15:33:32] [INFO ] Parsed PT model containing 30 places and 84 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:33:32] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 18 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-16 15:33:33] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 15:33:33] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-16 15:33:33] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned [0, 6, 7, 8, 12, 13, 15, 16, 19, 20, 21, 22, 23, 24, 26, 28, 39, 44, 45, 48, 53, 55, 56, 61, 64, 66, 71, 72, 74, 75]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[75, 74, 72, 71, 66, 64, 61, 56, 55, 53, 48, 45, 44, 39, 28, 26, 24, 23, 22, 21, 20, 19, 16, 15, 13, 12, 8, 7, 6, 0]
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:33] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:33] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:33] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:33] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:33] [INFO ] Dead Transitions using invariants and state equation in 52 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 15:33:33] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:33] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/30 places, 51/81 transitions.
[2021-05-16 15:33:33] [INFO ] Flatten gal took : 28 ms
[2021-05-16 15:33:33] [INFO ] Flatten gal took : 10 ms
[2021-05-16 15:33:33] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 100000 steps, including 14289 resets, run finished after 311 ms. (steps per millisecond=321 ) properties (out of 24) seen :17
Running SMT prover for 7 properties.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:33] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-16 15:33:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:34] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2021-05-16 15:33:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 8 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-16 15:33:34] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 11 ms to minimize.
[2021-05-16 15:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-16 15:33:34] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 12 ms.
[2021-05-16 15:33:34] [INFO ] Added : 7 causal constraints over 2 iterations in 58 ms. Result :sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned unsat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned unsat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned unsat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:33:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:33:34] [INFO ] Deduced a trap composed of 7 places in 12 ms of which 1 ms to minimize.
[2021-05-16 15:33:34] [INFO ] Deduced a trap composed of 11 places in 11 ms of which 1 ms to minimize.
[2021-05-16 15:33:34] [INFO ] Deduced a trap composed of 13 places in 12 ms of which 0 ms to minimize.
[2021-05-16 15:33:34] [INFO ] Deduced a trap composed of 14 places in 12 ms of which 1 ms to minimize.
[2021-05-16 15:33:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 66 ms
[2021-05-16 15:33:34] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 20 ms.
[2021-05-16 15:33:34] [INFO ] Added : 7 causal constraints over 2 iterations in 43 ms. Result :sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned unsat
[2021-05-16 15:33:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2021-05-16 15:33:34] [INFO ] Initial state test concluded for 2 properties.
FORMULA PhilosophersDyn-PT-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 9 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 10 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 15:33:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:34] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-05-16 15:33:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : PhilosophersDyn-PT-03-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT 3 (ADD s11 s13 s23)), p0:(GT (ADD s3 s7 s10) (ADD s2 s18 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14345 reset in 252 ms.
Product exploration explored 100000 steps with 14304 reset in 203 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 14318 reset in 146 ms.
Product exploration explored 100000 steps with 14342 reset in 197 ms.
[2021-05-16 15:33:35] [INFO ] Flatten gal took : 7 ms
[2021-05-16 15:33:35] [INFO ] Flatten gal took : 6 ms
[2021-05-16 15:33:35] [INFO ] Time to serialize gal into /tmp/LTL1004407330869618042.gal : 2 ms
[2021-05-16 15:33:35] [INFO ] Time to serialize properties into /tmp/LTL16693264904566548457.ltl : 9 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/LTL1004407330869618042.gal, -t, CGAL, -LTL, /tmp/LTL16693264904566548457.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/LTL1004407330869618042.gal -t CGAL -LTL /tmp/LTL16693264904566548457.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(((Think_3+Think_2)+Think_1)>((HasRight_2+HasRight_1)+HasRight_3))")||(G("(((HasLeft_2+HasLeft_3)+HasLeft_1)<3)")))))
Formula 0 simplified : !G("(((Think_3+Think_2)+Think_1)>((HasRight_2+HasRight_1)+HasRight_3))" | G"(((HasLeft_2+HasLeft_3)+HasLeft_1)<3)")
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, 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
9 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.106189,20220,1,0,111,14459,127,59,1878,15207,148
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PhilosophersDyn-PT-03-00 finished in 1532 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 9 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 15:33:36] [INFO ] Computed 11 place invariants in 10 ms
[2021-05-16 15:33:36] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:36] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:36] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-03-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s4 s12 s14)), p1:(GT (ADD s8 s28 s29) (ADD s3 s7 s10))], 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 16914 reset in 160 ms.
Product exploration explored 100000 steps with 16998 reset in 156 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17002 reset in 140 ms.
Product exploration explored 100000 steps with 16986 reset in 188 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 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 15:33:37] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-16 15:33:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
[2021-05-16 15:33:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:37] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:33:37] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 16959 reset in 314 ms.
Product exploration explored 100000 steps with 16986 reset in 174 ms.
[2021-05-16 15:33:38] [INFO ] Flatten gal took : 4 ms
[2021-05-16 15:33:38] [INFO ] Flatten gal took : 7 ms
[2021-05-16 15:33:38] [INFO ] Time to serialize gal into /tmp/LTL9659690683995581372.gal : 2 ms
[2021-05-16 15:33:38] [INFO ] Time to serialize properties into /tmp/LTL6546155969821956221.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/LTL9659690683995581372.gal, -t, CGAL, -LTL, /tmp/LTL6546155969821956221.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/LTL9659690683995581372.gal -t CGAL -LTL /tmp/LTL6546155969821956221.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((Forks_1+Forks_2)+Forks_3)<1)")))||(G("(((Outside_3+Outside_2)+Outside_1)>((Think_3+Think_2)+Think_1))"))))
Formula 0 simplified : !(XF"(((Forks_1+Forks_2)+Forks_3)<1)" | G"(((Outside_3+Outside_2)+Outside_1)>((Think_3+Think_2)+Think_1))")
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
17 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.192711,20864,1,0,121,15880,131,58,1865,16702,165
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PhilosophersDyn-PT-03-02 finished in 2163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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 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 15:33:38] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-16 15:33:38] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:38] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:33:38] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:38] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s4 s12 s14) (ADD s2 s18 s26))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-03 finished in 431 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X((F((p1||X(p1)))&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 12 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 15:33:38] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:38] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:38] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:39] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PhilosophersDyn-PT-03-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 7}, { cond=(NOT p0), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 9}, { cond=(NOT p0), acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=true, acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(NOT p2), acceptance={} source=10 dest: 11}], [{ cond=(NOT p2), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s4 s12 s14) (ADD s1 s20 s24)), p1:(LEQ 3 (ADD s3 s7 s10)), p2:(LEQ 1 (ADD s5 s9 s21))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, 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]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-04 finished in 778 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 15:33:39] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 15:33:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:39] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:39] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:39] [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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s8 s28 s29))], 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 7 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-06 finished in 241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 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 15:33:39] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:39] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:39] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-16 15:33:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(LEQ 1 s7)], 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 6 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-08 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 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 15:33:39] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:39] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:39] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-16 15:33:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:40] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s4 s8) (LEQ 3 s4))], 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-PT-03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-10 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 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 15:33:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:40] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:40] [INFO ] Implicit Places using invariants and state equation in 104 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 15:33:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PhilosophersDyn-PT-03-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s22 s11), p0:(LEQ s24 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 90 steps with 14 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-12 finished in 297 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 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 15:33:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:40] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:40] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:40] [INFO ] Computed 11 place invariants in 10 ms
[2021-05-16 15:33:40] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s2 s29) (GT s18 s3)), p1:(LEQ s2 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 130 steps with 17 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-15 finished in 233 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621179220929
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-PT-03"
export BK_EXAMINATION="LTLCardinality"
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-PT-03, examination is LTLCardinality"
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-162089267800044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;