About the Execution of ITS-Tools for Philosophers-PT-000020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.590 | 20352.00 | 36202.00 | 90.90 | TFTFFFFFFTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961389900121.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389900121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 82K Apr 27 15:14 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000020-00
FORMULA_NAME Philosophers-PT-000020-01
FORMULA_NAME Philosophers-PT-000020-02
FORMULA_NAME Philosophers-PT-000020-03
FORMULA_NAME Philosophers-PT-000020-04
FORMULA_NAME Philosophers-PT-000020-05
FORMULA_NAME Philosophers-PT-000020-06
FORMULA_NAME Philosophers-PT-000020-07
FORMULA_NAME Philosophers-PT-000020-08
FORMULA_NAME Philosophers-PT-000020-09
FORMULA_NAME Philosophers-PT-000020-10
FORMULA_NAME Philosophers-PT-000020-11
FORMULA_NAME Philosophers-PT-000020-12
FORMULA_NAME Philosophers-PT-000020-13
FORMULA_NAME Philosophers-PT-000020-14
FORMULA_NAME Philosophers-PT-000020-15
=== Now, execution of the tool begins
BK_START 1589786681621
[2020-05-18 07:24:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 07:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:24:43] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-18 07:24:43] [INFO ] Transformed 100 places.
[2020-05-18 07:24:43] [INFO ] Transformed 100 transitions.
[2020-05-18 07:24:43] [INFO ] Parsed PT model containing 100 places and 100 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 153 resets, run finished after 322 ms. (steps per millisecond=310 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 100 rows 100 cols
[2020-05-18 07:24:43] [INFO ] Computed 40 place invariants in 6 ms
[2020-05-18 07:24:43] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned unsat
[2020-05-18 07:24:43] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 3 ms returned unsat
[2020-05-18 07:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
[2020-05-18 07:24:44] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 07:24:44] [INFO ] Flatten gal took : 32 ms
FORMULA Philosophers-PT-000020-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 07:24:44] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 07:24:44] [INFO ] Applying decomposition
[2020-05-18 07:24:44] [INFO ] Flatten gal took : 12 ms
[2020-05-18 07:24:44] [INFO ] Input system was already deterministic with 100 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16197678739688155757.txt, -o, /tmp/graph16197678739688155757.bin, -w, /tmp/graph16197678739688155757.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 100 rows 100 cols
[2020-05-18 07:24:44] [INFO ] Computed 40 place invariants in 2 ms
inv : Think_14 + Catch1_14 + Catch2_14 + Eat_14 = 1
inv : Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
inv : Fork_15 + Catch1_16 + Catch2_15 + Eat_16 + Eat_15 = 1
inv : Fork_17 + Catch1_18 + Catch2_17 + Eat_18 + Eat_17 = 1
inv : Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
inv : Think_13 + Catch1_13 + Catch2_13 + Eat_13 = 1
inv : Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
inv : Think_20 + Catch1_20 + Catch2_20 + Eat_20 = 1
inv : Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
inv : Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
inv : Think_12 + Catch1_12 + Catch2_12 + Eat_12 = 1
inv : Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
inv : Fork_10 + Catch1_11 + Catch2_10 + Eat_11 + Eat_10 = 1
inv : Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
inv : Think_11 + Catch1_11 + Catch2_11 + Eat_11 = 1
inv : Fork_11 + Catch1_12 + Catch2_11 + Eat_11 + Eat_12 = 1
inv : Think_17 + Catch1_17 + Catch2_17 + Eat_17 = 1
inv : Fork_12 + Catch1_13 + Catch2_12 + Eat_13 + Eat_12 = 1
inv : Fork_13 + Catch1_14 + Catch2_13 + Eat_13 + Eat_14 = 1
inv : Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
inv : Think_15 + Catch1_15 + Catch2_15 + Eat_15 = 1
inv : Fork_19 + Catch1_20 + Catch2_19 + Eat_20 + Eat_19 = 1
inv : Think_16 + Catch1_16 + Catch2_16 + Eat_16 = 1
inv : Think_18 + Catch1_18 + Catch2_18 + Eat_18 = 1
inv : Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
inv : Fork_1 + Catch1_2 + Catch2_1 + Eat_2 + Eat_1 = 1
inv : Fork_16 + Catch1_17 + Catch2_16 + Eat_16 + Eat_17 = 1
inv : Fork_14 + Catch1_15 + Catch2_14 + Eat_14 + Eat_15 = 1
inv : Fork_18 + Catch1_19 + Catch2_18 + Eat_18 + Eat_19 = 1
inv : Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
inv : Think_19 + Catch1_19 + Catch2_19 + Eat_19 = 1
inv : Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
inv : Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
inv : Fork_20 + Catch1_1 + Eat_1 + Catch2_20 + Eat_20 = 1
inv : Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
inv : Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
inv : Fork_9 + Catch1_10 + Catch2_9 + Eat_10 + Eat_9 = 1
inv : Fork_7 + Catch1_8 + Catch2_7 + Eat_7 + Eat_8 = 1
inv : Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
inv : Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
Total of 40 invariants.
[2020-05-18 07:24:44] [INFO ] Computed 40 place invariants in 3 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16197678739688155757.bin, -l, -1, -v, -w, /tmp/graph16197678739688155757.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:24:44] [INFO ] Decomposing Gal with order
[2020-05-18 07:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 07:24:44] [INFO ] Removed a total of 78 redundant transitions.
[2020-05-18 07:24:44] [INFO ] Flatten gal took : 77 ms
[2020-05-18 07:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-18 07:24:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-18 07:24:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !((F(!((F("((((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15)<3)"))U(!(F("((((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15)>=3)")))))))
Formula 0 simplified : !F!(F"((((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15)<3)" U !F"((((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15)>=3)")
[2020-05-18 07:24:44] [INFO ] Proved 100 variables to be positive in 250 ms
[2020-05-18 07:24:44] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2020-05-18 07:24:44] [INFO ] Computation of disable matrix completed :0/100 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:24:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:24:44] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2020-05-18 07:24:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
72 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.74723,42432,1,0,60,118737,23,58,2750,171933,153
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("((((((((((((((((((((gu2.Catch1_1+gu2.Catch1_4)+gu2.Catch1_5)+gu2.Catch1_2)+gu2.Catch1_3)+gu2.Catch1_9)+gu2.Catch1_8)+gu2.Catch1_7)+gu2.Catch1_6)+gu2.Catch1_13)+gu2.Catch1_12)+gu2.Catch1_11)+gu2.Catch1_10)+gu2.Catch1_17)+gu2.Catch1_16)+gu2.Catch1_15)+gu2.Catch1_14)+gu2.Catch1_20)+gu2.Catch1_19)+gu2.Catch1_18)<=(((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19))")))
Formula 1 simplified : !G"((((((((((((((((((((gu2.Catch1_1+gu2.Catch1_4)+gu2.Catch1_5)+gu2.Catch1_2)+gu2.Catch1_3)+gu2.Catch1_9)+gu2.Catch1_8)+gu2.Catch1_7)+gu2.Catch1_6)+gu2.Catch1_13)+gu2.Catch1_12)+gu2.Catch1_11)+gu2.Catch1_10)+gu2.Catch1_17)+gu2.Catch1_16)+gu2.Catch1_15)+gu2.Catch1_14)+gu2.Catch1_20)+gu2.Catch1_19)+gu2.Catch1_18)<=(((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19))"
Computing Next relation with stutter on 2 deadlock states
[2020-05-18 07:24:48] [INFO ] Computing symmetric co enabling matrix : 100 transitions.
[2020-05-18 07:24:48] [INFO ] Computation of co-enabling matrix(0/100) took 19 ms. Total solver calls (SAT/UNSAT): 8(3/5)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
362 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,4.37351,96356,1,0,86,249112,35,90,22058,428636,258
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G((X(G(X(F("((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)>=3)")))))U(((X("((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))"))||("((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)>=3)"))||("((((((((((((((((((((gu2.Catch1_1+gu2.Catch1_4)+gu2.Catch1_5)+gu2.Catch1_2)+gu2.Catch1_3)+gu2.Catch1_9)+gu2.Catch1_8)+gu2.Catch1_7)+gu2.Catch1_6)+gu2.Catch1_13)+gu2.Catch1_12)+gu2.Catch1_11)+gu2.Catch1_10)+gu2.Catch1_17)+gu2.Catch1_16)+gu2.Catch1_15)+gu2.Catch1_14)+gu2.Catch1_20)+gu2.Catch1_19)+gu2.Catch1_18)<2)"))))))
Formula 2 simplified : G(XGXF"((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)>=3)" U ("((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)>=3)" | "((((((((((((((((((((gu2.Catch1_1+gu2.Catch1_4)+gu2.Catch1_5)+gu2.Catch1_2)+gu2.Catch1_3)+gu2.Catch1_9)+gu2.Catch1_8)+gu2.Catch1_7)+gu2.Catch1_6)+gu2.Catch1_13)+gu2.Catch1_12)+gu2.Catch1_11)+gu2.Catch1_10)+gu2.Catch1_17)+gu2.Catch1_16)+gu2.Catch1_15)+gu2.Catch1_14)+gu2.Catch1_20)+gu2.Catch1_19)+gu2.Catch1_18)<2)" | X"((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))"))
Computing Next relation with stutter on 2 deadlock states
[2020-05-18 07:24:50] [INFO ] Computation of Finished co-enabling matrix. took 2047 ms. Total solver calls (SAT/UNSAT): 520(100/420)
[2020-05-18 07:24:50] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2020-05-18 07:24:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:24:50] [INFO ] Built C files in 5729ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 1636 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( []((X([](X(<>((LTLAP3==true))))))U(( ( X((LTLAP4==true))) || ( (LTLAP3==true)) ) || ( (LTLAP5==true)) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( []((X([](X(<>((LTLAP3==true))))))U(( ( X((LTLAP4==true))) || ( (LTLAP3==true)) ) || ( (LTLAP5==true)) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( []((X([](X(<>((LTLAP3==true))))))U(( ( X((LTLAP4==true))) || ( (LTLAP3==true)) ) || ( (LTLAP5==true)) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
337 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,7.73512,159596,1,0,110,547672,57,121,25233,921909,361
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(G("((((((((((((((((((((gi2.gu0.Think_1+gi2.gu0.Think_2)+gi2.gu0.Think_3)+gi2.gu0.Think_4)+gi2.gu0.Think_5)+gi2.gu0.Think_6)+gi2.gu0.Think_7)+gi2.gu0.Think_8)+gi2.gu0.Think_9)+gi2.gu0.Think_10)+gi2.gu0.Think_11)+gi2.gu0.Think_12)+gi2.gu0.Think_13)+gi2.gu0.Think_15)+gi2.gu0.Think_14)+gi2.gu0.Think_17)+gi2.gu0.Think_16)+gi2.gu0.Think_19)+gi2.gu0.Think_18)+gi2.gu0.Think_20)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))")))U("((((((((((((((((((((gi2.gu0.Think_1+gi2.gu0.Think_2)+gi2.gu0.Think_3)+gi2.gu0.Think_4)+gi2.gu0.Think_5)+gi2.gu0.Think_6)+gi2.gu0.Think_7)+gi2.gu0.Think_8)+gi2.gu0.Think_9)+gi2.gu0.Think_10)+gi2.gu0.Think_11)+gi2.gu0.Think_12)+gi2.gu0.Think_13)+gi2.gu0.Think_15)+gi2.gu0.Think_14)+gi2.gu0.Think_17)+gi2.gu0.Think_16)+gi2.gu0.Think_19)+gi2.gu0.Think_18)+gi2.gu0.Think_20)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))")))
Formula 3 simplified : !(!G"((((((((((((((((((((gi2.gu0.Think_1+gi2.gu0.Think_2)+gi2.gu0.Think_3)+gi2.gu0.Think_4)+gi2.gu0.Think_5)+gi2.gu0.Think_6)+gi2.gu0.Think_7)+gi2.gu0.Think_8)+gi2.gu0.Think_9)+gi2.gu0.Think_10)+gi2.gu0.Think_11)+gi2.gu0.Think_12)+gi2.gu0.Think_13)+gi2.gu0.Think_15)+gi2.gu0.Think_14)+gi2.gu0.Think_17)+gi2.gu0.Think_16)+gi2.gu0.Think_19)+gi2.gu0.Think_18)+gi2.gu0.Think_20)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))" U "((((((((((((((((((((gi2.gu0.Think_1+gi2.gu0.Think_2)+gi2.gu0.Think_3)+gi2.gu0.Think_4)+gi2.gu0.Think_5)+gi2.gu0.Think_6)+gi2.gu0.Think_7)+gi2.gu0.Think_8)+gi2.gu0.Think_9)+gi2.gu0.Think_10)+gi2.gu0.Think_11)+gi2.gu0.Think_12)+gi2.gu0.Think_13)+gi2.gu0.Think_15)+gi2.gu0.Think_14)+gi2.gu0.Think_17)+gi2.gu0.Think_16)+gi2.gu0.Think_19)+gi2.gu0.Think_18)+gi2.gu0.Think_20)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
90 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,8.6464,172796,1,0,111,547880,66,125,28720,922840,414
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G(("((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)<3)")U(("((((((((((((((((((((gu2.Catch1_1+gu2.Catch1_4)+gu2.Catch1_5)+gu2.Catch1_2)+gu2.Catch1_3)+gu2.Catch1_9)+gu2.Catch1_8)+gu2.Catch1_7)+gu2.Catch1_6)+gu2.Catch1_13)+gu2.Catch1_12)+gu2.Catch1_11)+gu2.Catch1_10)+gu2.Catch1_17)+gu2.Catch1_16)+gu2.Catch1_15)+gu2.Catch1_14)+gu2.Catch1_20)+gu2.Catch1_19)+gu2.Catch1_18)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))")U(!(X("((((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15)>=2)"))))))))
Formula 4 simplified : !FG("((((((((((((((((((((gu1.Fork_1+gu1.Fork_3)+gu1.Fork_2)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_12)+gu1.Fork_13)+gu1.Fork_10)+gu1.Fork_11)+gu1.Fork_16)+gu1.Fork_17)+gu1.Fork_14)+gu1.Fork_15)+gu1.Fork_20)+gu1.Fork_18)+gu1.Fork_19)<3)" U ("((((((((((((((((((((gu2.Catch1_1+gu2.Catch1_4)+gu2.Catch1_5)+gu2.Catch1_2)+gu2.Catch1_3)+gu2.Catch1_9)+gu2.Catch1_8)+gu2.Catch1_7)+gu2.Catch1_6)+gu2.Catch1_13)+gu2.Catch1_12)+gu2.Catch1_11)+gu2.Catch1_10)+gu2.Catch1_17)+gu2.Catch1_16)+gu2.Catch1_15)+gu2.Catch1_14)+gu2.Catch1_20)+gu2.Catch1_19)+gu2.Catch1_18)<=(((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15))" U !X"((((((((((((((((((((gi2.gu3.Eat_3+gi2.gu3.Eat_2)+gi2.gu3.Eat_5)+gi2.gu3.Eat_4)+gi2.gu3.Eat_1)+gi2.gu3.Eat_11)+gi2.gu3.Eat_10)+gi2.gu3.Eat_13)+gi2.gu3.Eat_12)+gi2.gu3.Eat_7)+gi2.gu3.Eat_6)+gi2.gu3.Eat_9)+gi2.gu3.Eat_8)+gi2.gu3.Eat_20)+gi2.gu3.Eat_18)+gi2.gu3.Eat_19)+gi2.gu3.Eat_16)+gi2.gu3.Eat_17)+gi2.gu3.Eat_14)+gi2.gu3.Eat_15)>=2)"))
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
435 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,12.998,263256,1,0,129,855163,89,138,41575,1.61459e+06,461
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(G("(gi2.gu0.Think_5<=gu1.Fork_20)")))))
Formula 5 simplified : !X!G"(gi2.gu0.Think_5<=gu1.Fork_20)"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
12 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,13.1266,266688,1,0,149,872837,98,158,41580,1.64058e+06,566
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(F(X("(gu2.Catch1_3>=1)"))))))
Formula 6 simplified : !XGFX"(gu2.Catch1_3>=1)"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.1378,267208,1,0,150,874594,107,160,41581,1.64242e+06,575
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(((G(X("(gi2.gu0.Catch2_15<=gi2.gu0.Think_11)")))||(X("((gu1.Fork_14<=gi2.gu0.Think_18)&&(gu1.Catch2_19<=gu1.Fork_3))")))||("(gu2.Catch1_7<=gi2.gu3.Eat_3)")))))
Formula 7 simplified : !GX("(gu2.Catch1_7<=gi2.gu3.Eat_3)" | GX"(gi2.gu0.Catch2_15<=gi2.gu0.Think_11)" | X"((gu1.Fork_14<=gi2.gu0.Think_18)&&(gu1.Catch2_19<=gu1.Fork_3))")
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
4 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
136 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,14.5052,298976,1,0,206,1.00468e+06,134,224,41610,1.90113e+06,782
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(X("(gu1.Fork_9<=gi2.gu3.Eat_20)")))))
Formula 8 simplified : XX"(gu1.Fork_9<=gi2.gu3.Eat_20)"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 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,14.5134,299504,1,0,208,1.00561e+06,137,225,41615,1.9017e+06,789
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F((!(X("(gu2.Catch1_3<=gi2.gu3.Eat_4)")))U(X("(gu1.Fork_8>gu1.Catch2_9)"))))))
Formula 9 simplified : F(!X"(gu2.Catch1_3<=gi2.gu3.Eat_4)" U X"(gu1.Fork_8>gu1.Catch2_9)")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13 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,14.6383,303720,1,0,252,1.02974e+06,143,267,41621,1.9359e+06,900
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1589786701973
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000020"
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"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000020, 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 r126-tajo-158961389900121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 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 ;