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.r066-tajo-158922814100265.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 DatabaseWithMutex-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814100265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.5K Mar 31 05:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 31 05:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 29 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 29 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 28 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 27 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 29K Mar 24 05:37 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 DatabaseWithMutex-PT-02-00
FORMULA_NAME DatabaseWithMutex-PT-02-01
FORMULA_NAME DatabaseWithMutex-PT-02-02
FORMULA_NAME DatabaseWithMutex-PT-02-03
FORMULA_NAME DatabaseWithMutex-PT-02-04
FORMULA_NAME DatabaseWithMutex-PT-02-05
FORMULA_NAME DatabaseWithMutex-PT-02-06
FORMULA_NAME DatabaseWithMutex-PT-02-07
FORMULA_NAME DatabaseWithMutex-PT-02-08
FORMULA_NAME DatabaseWithMutex-PT-02-09
FORMULA_NAME DatabaseWithMutex-PT-02-10
FORMULA_NAME DatabaseWithMutex-PT-02-11
FORMULA_NAME DatabaseWithMutex-PT-02-12
FORMULA_NAME DatabaseWithMutex-PT-02-13
FORMULA_NAME DatabaseWithMutex-PT-02-14
FORMULA_NAME DatabaseWithMutex-PT-02-15

=== Now, execution of the tool begins

BK_START 1590107181047

[2020-05-22 00:26:26] [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-22 00:26:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 00:26:26] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2020-05-22 00:26:26] [INFO ] Transformed 38 places.
[2020-05-22 00:26:26] [INFO ] Transformed 32 transitions.
[2020-05-22 00:26:26] [INFO ] Parsed PT model containing 38 places and 32 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 257 ms. (steps per millisecond=389 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 32 rows 38 cols
[2020-05-22 00:26:26] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-22 00:26:26] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-05-22 00:26:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-22 00:26:27] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-05-22 00:26:27] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 15 simplifications.
[2020-05-22 00:26:27] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-22 00:26:27] [INFO ] Flatten gal took : 25 ms
FORMULA DatabaseWithMutex-PT-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 00:26:27] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 00:26:27] [INFO ] Applying decomposition
[2020-05-22 00:26:27] [INFO ] Flatten gal took : 10 ms
[2020-05-22 00:26:27] [INFO ] Input system was already deterministic with 32 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/graph5308047654206035229.txt, -o, /tmp/graph5308047654206035229.bin, -w, /tmp/graph5308047654206035229.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph5308047654206035229.bin, -l, -1, -v, -w, /tmp/graph5308047654206035229.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 38 cols
[2020-05-22 00:26:27] [INFO ] Computed 10 place invariants in 2 ms
inv : MesBuffReply_2_1 + Modify_2_1 + Modify_1_1 + RecBuff_2_1 + updating_2_1 + Acknowledge_2_1 + Mutex_1 + Active_2_1 + Message_2_1 = 1
inv : updating_1_1 + updating_1_2 + all_passive_1 = 1
inv : -Modify_2_1 - WaitMutex_2_2 - all_active_2 + Active_1_2 + Mutex_2 - Active_2_1 + Modify_1_2 - WaitMutex_2_1 = 0
inv : Modify_2_2 + Modify_2_1 + MesBuffReply_1_2 + WaitMutex_2_2 + Message_1_2 + all_active_2 + Acknowledge_1_2 + updating_1_2 + RecBuff_1_2 + Active_2_1 + WaitMutex_2_1 = 1
inv : all_passive_2 + updating_2_1 + updating_2_2 = 1
inv : Modify_2_1 + Modify_1_1 + Active_1_1 + Mutex_1 + Active_2_1 = 1
inv : -Modify_2_1 + Message_2_2 - WaitMutex_2_2 - all_active_2 + Acknowledge_2_2 + Mutex_2 + RecBuff_2_2 + updating_2_2 - Active_2_1 + Modify_1_2 + MesBuffReply_2_2 - WaitMutex_2_1 = 0
inv : RecBuff_1_1 + updating_1_1 + Acknowledge_1_1 - Active_2_1 + MesBuffReply_1_1 + Message_1_1 = 0
inv : Modify_2_2 + Modify_2_1 + WaitMutex_2_2 + all_active_2 + Active_2_2 + Active_2_1 + WaitMutex_2_1 = 1
inv : WaitMutex_1_1 + all_active_1 + WaitMutex_2_2 + WaitMutex_1_2 + all_active_2 - Mutex_2 - Mutex_1 + WaitMutex_2_1 = 0
Total of 10 invariants.
[2020-05-22 00:26:27] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-22 00:26:27] [INFO ] Decomposing Gal with order
[2020-05-22 00:26:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 00:26:27] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-22 00:26:27] [INFO ] Flatten gal took : 70 ms
[2020-05-22 00:26:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2020-05-22 00:26:27] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-22 00:26:27] [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 : !((X(F(((G("((((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1)>=1)"))||("((((gu4.Active_1_2+gu4.Active_2_2)+gu4.Active_1_1)+gu4.Active_2_1)<=(((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1))"))U(F("((((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1)>=1)"))))))
Formula 0 simplified : !XF(("((((gu4.Active_1_2+gu4.Active_2_2)+gu4.Active_1_1)+gu4.Active_2_1)<=(((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1))" | G"((((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1)>=1)") U F"((((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1)>=1)")
[2020-05-22 00:26:27] [INFO ] Proved 38 variables to be positive in 378 ms
[2020-05-22 00:26:27] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2020-05-22 00:26:27] [INFO ] Computation of disable matrix completed :0/32 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 00:26:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 00:26:27] [INFO ] Computing symmetric may enable matrix : 32 transitions.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-22 00:26:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.065291,16684,1,0,6,3891,20,0,821,951,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X(X(X(!(F(X(X("((((gi1.gu0.Message_2_2+gi1.gu0.Message_1_2)+gi1.gu0.Message_2_1)+gi1.gu0.Message_1_1)>=2)"))))))))))
Formula 1 simplified : XXX!FXX"((((gi1.gu0.Message_2_2+gi1.gu0.Message_1_2)+gi1.gu0.Message_2_1)+gi1.gu0.Message_1_1)>=2)"
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.091656,18296,1,0,34,8621,29,9,832,10389,76
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("(((((gu3.Acknowledge_2_2+gu3.Acknowledge_1_2)+gu3.Acknowledge_2_1)+gu3.Acknowledge_1_1)>=2)&&((((gi1.gu2.RecBuff_1_1+gi1.gu2.RecBuff_2_1)+gi1.gu2.RecBuff_1_2)+gi1.gu2.RecBuff_2_2)>=0))")))
Formula 2 simplified : !F"(((((gu3.Acknowledge_2_2+gu3.Acknowledge_1_2)+gu3.Acknowledge_2_1)+gu3.Acknowledge_1_1)>=2)&&((((gi1.gu2.RecBuff_1_1+gi1.gu2.RecBuff_2_1)+gi1.gu2.RecBuff_1_2)+gi1.gu2.RecBuff_2_2)>=0))"
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.10407,18560,1,0,51,10327,38,21,853,13705,150
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(F("((((gu1.MesBuffReply_2_1+gu1.MesBuffReply_1_2)+gu1.MesBuffReply_2_2)+gu1.MesBuffReply_1_1)>(((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1))")))))
Formula 3 simplified : !FXF"((((gu1.MesBuffReply_2_1+gu1.MesBuffReply_1_2)+gu1.MesBuffReply_2_2)+gu1.MesBuffReply_1_1)>(((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.111824,19084,1,0,71,11734,47,33,884,16319,214
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(G(!((G(F(G("((((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1)<=(((gu4.Modify_2_2+gu4.Modify_2_1)+gu4.Modify_1_1)+gu4.Modify_1_2))"))))U((F(G("((((gu1.MesBuffReply_2_1+gu1.MesBuffReply_1_2)+gu1.MesBuffReply_2_2)+gu1.MesBuffReply_1_1)<=(gu1.all_active_1+gu1.all_active_2))")))||("((((gu3.Acknowledge_2_2+gu3.Acknowledge_1_2)+gu3.Acknowledge_2_1)+gu3.Acknowledge_1_1)<=(((gu3.updating_2_1+gu3.updating_1_1)+gu3.updating_1_2)+gu3.updating_2_2))"))))))))
Formula 4 simplified : !GFG!(GFG"((((gu4.WaitMutex_1_1+gu4.WaitMutex_2_2)+gu4.WaitMutex_1_2)+gu4.WaitMutex_2_1)<=(((gu4.Modify_2_2+gu4.Modify_2_1)+gu4.Modify_1_1)+gu4.Modify_1_2))" U ("((((gu3.Acknowledge_2_2+gu3.Acknowledge_1_2)+gu3.Acknowledge_2_1)+gu3.Acknowledge_1_1)<=(((gu3.updating_2_1+gu3.updating_1_1)+gu3.updating_1_2)+gu3.updating_2_2))" | FG"((((gu1.MesBuffReply_2_1+gu1.MesBuffReply_1_2)+gu1.MesBuffReply_2_2)+gu1.MesBuffReply_1_1)<=(gu1.all_active_1+gu1.all_active_2))"))
9 unique states visited
2 strongly connected components in search stack
9 transitions explored
9 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.150766,20520,1,0,98,13792,62,39,1008,19141,323
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(G("(gu3.updating_2_2<=gu1.MesBuffReply_2_2)")))))
Formula 5 simplified : !F!G"(gu3.updating_2_2<=gu1.MesBuffReply_2_2)"
2 unique states visited
2 strongly connected components in search stack
2 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.152841,20784,1,0,119,14081,71,48,1012,19644,388
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((X(!(F("(gi1.gu2.all_passive_1<=gi1.gu2.RecBuff_1_2)"))))&&("(gi1.gu2.RecBuff_2_1<=gi1.gu0.Message_1_1)"))U("(gi1.gu2.RecBuff_2_1<1)"))))
Formula 6 simplified : !X(("(gi1.gu2.RecBuff_2_1<=gi1.gu0.Message_1_1)" & X!F"(gi1.gu2.all_passive_1<=gi1.gu2.RecBuff_1_2)") U "(gi1.gu2.RecBuff_2_1<1)")
2 unique states visited
0 strongly connected components in search stack
1 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.154639,21276,1,0,119,14081,81,48,1019,19644,392
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(F("(gu4.WaitMutex_1_2>gi1.gu2.all_passive_1)")))||(X(F(G("(gu4.Modify_2_1>gu4.WaitMutex_1_1)"))))))
Formula 7 simplified : !(XF"(gu4.WaitMutex_1_2>gi1.gu2.all_passive_1)" | XFG"(gu4.Modify_2_1>gu4.WaitMutex_1_1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.166491,21520,1,0,173,16372,100,73,1035,23497,518
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X("(gu3.Mutex_2<=gu3.updating_2_2)"))))
Formula 8 simplified : !GX"(gu3.Mutex_2<=gu3.updating_2_2)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.167492,21780,1,0,173,16373,108,73,1038,23498,530
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(((!(("(gu4.WaitMutex_1_1<=gi1.gu2.all_passive_1)")U("(gu4.Active_2_2>gu1.all_active_1)")))&&(G(X(F(!(X("(gi1.gu2.RecBuff_1_2>=1)")))))))&&("(gu4.Active_2_2<=gu1.all_active_1)"))))
Formula 9 simplified : !X("(gu4.Active_2_2<=gu1.all_active_1)" & !("(gu4.WaitMutex_1_1<=gi1.gu2.all_passive_1)" U "(gu4.Active_2_2>gu1.all_active_1)") & GXF!X"(gi1.gu2.RecBuff_1_2>=1)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.190133,22552,1,0,201,17409,130,85,1060,25400,607
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 00:26:28] [WARNING] Script execution failed on command (assert (and (>= (select s0 9) 1) (= (store (store (store s0 9 (- (select s0 9) 1)) 26 (+ (select s0 26) 1)) 36 (+ (select s0 36) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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-22 00:26:28] [INFO ] Built C files in 839ms 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 1590107188947

--------------------
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="DatabaseWithMutex-PT-02"
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 DatabaseWithMutex-PT-02, 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 r066-tajo-158922814100265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-02.tgz
mv DatabaseWithMutex-PT-02 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;