About the Execution of ITS-Tools for SharedMemory-PT-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15727.470 | 11204.00 | 15801.00 | 2914.30 | TFTFFFFTFTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r156-oct2-158972914200545.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 SharedMemory-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972914200545
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 5.6K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 83K 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 SharedMemory-PT-000005-00
FORMULA_NAME SharedMemory-PT-000005-01
FORMULA_NAME SharedMemory-PT-000005-02
FORMULA_NAME SharedMemory-PT-000005-03
FORMULA_NAME SharedMemory-PT-000005-04
FORMULA_NAME SharedMemory-PT-000005-05
FORMULA_NAME SharedMemory-PT-000005-06
FORMULA_NAME SharedMemory-PT-000005-07
FORMULA_NAME SharedMemory-PT-000005-08
FORMULA_NAME SharedMemory-PT-000005-09
FORMULA_NAME SharedMemory-PT-000005-10
FORMULA_NAME SharedMemory-PT-000005-11
FORMULA_NAME SharedMemory-PT-000005-12
FORMULA_NAME SharedMemory-PT-000005-13
FORMULA_NAME SharedMemory-PT-000005-14
FORMULA_NAME SharedMemory-PT-000005-15
=== Now, execution of the tool begins
BK_START 1589913169440
[2020-05-19 18:32:51] [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-19 18:32:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 18:32:51] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-05-19 18:32:51] [INFO ] Transformed 41 places.
[2020-05-19 18:32:51] [INFO ] Transformed 55 transitions.
[2020-05-19 18:32:51] [INFO ] Found NUPN structural information;
[2020-05-19 18:32:51] [INFO ] Parsed PT model containing 41 places and 55 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 404 ms. (steps per millisecond=247 ) properties seen :[1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 55 rows 41 cols
[2020-05-19 18:32:52] [INFO ] Computed 11 place invariants in 3 ms
[2020-05-19 18:32:52] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned unsat
[2020-05-19 18:32:52] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned unsat
[2020-05-19 18:32:52] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-05-19 18:32:52] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-05-19 18:32:52] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-05-19 18:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 18:32:52] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-19 18:32:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 18:32:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 83 ms returned unsat
[2020-05-19 18:32:53] [INFO ] [Real]Absence check using 11 positive place invariants in 42 ms returned unsat
[2020-05-19 18:32:53] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-05-19 18:32:53] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2020-05-19 18:32:53] [INFO ] [Real]Absence check using 11 positive place invariants in 69 ms returned sat
[2020-05-19 18:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 18:32:53] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-05-19 18:32:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 18:32:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned unsat
[2020-05-19 18:32:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-05-19 18:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 18:32:53] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-19 18:32:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 18:32:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 52 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
[2020-05-19 18:32:57] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-19 18:32:57] [INFO ] Flatten gal took : 53 ms
FORMULA SharedMemory-PT-000005-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000005-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 18:32:57] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2020-05-19 18:32:58] [INFO ] Applying decomposition
[2020-05-19 18:32:58] [INFO ] Flatten gal took : 5 ms
Built C files in :
/home/mcc/execution
[2020-05-19 18:32:58] [INFO ] Input system was already deterministic with 55 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/graph225394841514653009.txt, -o, /tmp/graph225394841514653009.bin, -w, /tmp/graph225394841514653009.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 55 rows 41 cols
[2020-05-19 18:32:58] [INFO ] Computed 11 place invariants in 4 ms
inv : Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Active_5 + Queue_5 + OwnMemAcc_5 = 1
inv : Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Memory_1 = 1
inv : Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Active_4 + Queue_4 + OwnMemAcc_4 = 1
inv : Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Active_1 + Queue_1 + OwnMemAcc_1 = 1
inv : Ext_Mem_Acc_1_5 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_4_5 + Memory_5 = 1
inv : Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Active_3 + Queue_3 + OwnMemAcc_3 = 1
inv : Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_2_5 + Ext_Bus + Ext_Mem_Acc_4_5 = 1
inv : Ext_Mem_Acc_1_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_5_3 + Memory_3 = 1
inv : Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Active_2 + Queue_2 + OwnMemAcc_2 = 1
inv : Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Memory_2 = 1
inv : Ext_Mem_Acc_1_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_5_4 + Memory_4 = 1
Total of 11 invariants.
[2020-05-19 18:32:58] [INFO ] Computed 11 place invariants in 4 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/graph225394841514653009.bin, -l, -1, -v, -w, /tmp/graph225394841514653009.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 18:32:58] [INFO ] Decomposing Gal with order
[2020-05-19 18:32:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 18:32:58] [INFO ] Removed a total of 40 redundant transitions.
[2020-05-19 18:32:58] [INFO ] Proved 41 variables to be positive in 107 ms
[2020-05-19 18:32:58] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2020-05-19 18:32:58] [INFO ] Computation of disable matrix completed :0/55 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 18:32:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 18:32:58] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2020-05-19 18:32:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 18:32:58] [INFO ] Flatten gal took : 113 ms
[2020-05-19 18:32:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-19 18:32:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-19 18:32:58] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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 8 LTL properties
Checking formula 0 : !((F(X(F("(((((gu3.OwnMemAcc_1+gu3.OwnMemAcc_4)+gu3.OwnMemAcc_5)+gu3.OwnMemAcc_2)+gu3.OwnMemAcc_3)<2)")))))
Formula 0 simplified : !FXF"(((((gu3.OwnMemAcc_1+gu3.OwnMemAcc_4)+gu3.OwnMemAcc_5)+gu3.OwnMemAcc_2)+gu3.OwnMemAcc_3)<2)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
4 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.061077,18588,1,0,6,10708,20,0,1175,2902,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!(X("(((((gu1.Active_1+gu1.Active_3)+gu1.Active_2)+gu1.Active_4)+gu1.Active_5)>=2)")))))
Formula 1 simplified : !F!X"(((((gu1.Active_1+gu1.Active_3)+gu1.Active_2)+gu1.Active_4)+gu1.Active_5)>=2)"
3 unique states visited
3 strongly connected components in search stack
3 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,0.087717,20020,1,0,12,13731,29,4,1204,8361,36
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((X("(((((gu2.Memory_2+gu2.Memory_1)+gu2.Memory_4)+gu2.Memory_3)+gu2.Memory_5)<=((((gu2.Queue_1+gu2.Queue_2)+gu2.Queue_5)+gu2.Queue_3)+gu2.Queue_4))"))U(X((G(X(F("(((((gu3.OwnMemAcc_1+gu3.OwnMemAcc_4)+gu3.OwnMemAcc_5)+gu3.OwnMemAcc_2)+gu3.OwnMemAcc_3)>=2)"))))&&("(((((gu3.OwnMemAcc_1+gu3.OwnMemAcc_4)+gu3.OwnMemAcc_5)+gu3.OwnMemAcc_2)+gu3.OwnMemAcc_3)>=2)"))))))
Formula 2 simplified : !X(X"(((((gu2.Memory_2+gu2.Memory_1)+gu2.Memory_4)+gu2.Memory_3)+gu2.Memory_5)<=((((gu2.Queue_1+gu2.Queue_2)+gu2.Queue_5)+gu2.Queue_3)+gu2.Queue_4))" U X("(((((gu3.OwnMemAcc_1+gu3.OwnMemAcc_4)+gu3.OwnMemAcc_5)+gu3.OwnMemAcc_2)+gu3.OwnMemAcc_3)>=2)" & GXF"(((((gu3.OwnMemAcc_1+gu3.OwnMemAcc_4)+gu3.OwnMemAcc_5)+gu3.OwnMemAcc_2)+gu3.OwnMemAcc_3)>=2)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 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.12065,22472,1,0,22,18251,32,7,1217,14469,63
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X("(((((gu1.Active_1+gu1.Active_3)+gu1.Active_2)+gu1.Active_4)+gu1.Active_5)<1)")))))
Formula 3 simplified : !FGX"(((((gu1.Active_1+gu1.Active_3)+gu1.Active_2)+gu1.Active_4)+gu1.Active_5)<1)"
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
0 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.126009,22708,1,0,22,18433,41,7,1273,14939,77
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G("((gu2.Queue_3==0)||(gu3.OwnMemAcc_4==1))"))&&(X("(gu0.Ext_Bus==1)"))))
Formula 4 simplified : !(G"((gu2.Queue_3==0)||(gu3.OwnMemAcc_4==1))" & X"(gu0.Ext_Bus==1)")
5 unique states visited
5 strongly connected components in search stack
6 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,0.133961,23408,1,0,42,19781,58,13,1286,16963,137
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((G("((gu2.Queue_3==0)||(gu1.Active_2==1))"))&&(((F(!(F(("((gu2.Memory_1==0)||(gu3.OwnMemAcc_5==1))")U("((gu2.Memory_1!=0)&&(gu3.OwnMemAcc_5!=1))")))))||("(gu3.OwnMemAcc_1==0)"))||("(gu2.Memory_1==1)")))))
Formula 5 simplified : !G(G"((gu2.Queue_3==0)||(gu1.Active_2==1))" & ("(gu2.Memory_1==1)" | "(gu3.OwnMemAcc_1==0)" | F!F("((gu2.Memory_1==0)||(gu3.OwnMemAcc_5==1))" U "((gu2.Memory_1!=0)&&(gu3.OwnMemAcc_5!=1))")))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
5 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.188801,26328,1,0,67,26409,78,24,1304,30711,221
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G("(gu0.Ext_Bus==1)"))))
Formula 6 simplified : !FG"(gu0.Ext_Bus==1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.195683,26592,1,0,73,27177,89,26,1304,32319,261
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(G(F(X(F(((G("((gu1.Active_5==0)||(gu2.Memory_1==1))"))&&(X("((gu0.Ext_Bus==0)||(gu1.Active_3==1))")))U((G("((gu0.Ext_Bus==0)||(gu0.Ext_Mem_Acc_1_3==1))"))&&("((gu0.Ext_Bus==0)||(gu0.Ext_Mem_Acc_1_3==1))")))))))))
Formula 7 simplified : GFXF((G"((gu1.Active_5==0)||(gu2.Memory_1==1))" & X"((gu0.Ext_Bus==0)||(gu1.Active_3==1))") U ("((gu0.Ext_Bus==0)||(gu0.Ext_Mem_Acc_1_3==1))" & G"((gu0.Ext_Bus==0)||(gu0.Ext_Mem_Acc_1_3==1))"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 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.197323,26996,1,0,73,27177,98,26,1310,32319,269
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-19 18:32:58] [INFO ] Built C files in 665ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1589913180644
--------------------
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="SharedMemory-PT-000005"
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 SharedMemory-PT-000005, 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 r156-oct2-158972914200545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 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 ;