About the Execution of ITS-Tools for DatabaseWithMutex-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.760 | 3355.00 | 7465.00 | 42.60 | TTFFTFFFFTFFTFFF | 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.r066-tajo-158922814000225.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-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814000225
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.0K Mar 31 05:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 05:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 29 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 3.9K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 19K 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-COL-02-00
FORMULA_NAME DatabaseWithMutex-COL-02-01
FORMULA_NAME DatabaseWithMutex-COL-02-02
FORMULA_NAME DatabaseWithMutex-COL-02-03
FORMULA_NAME DatabaseWithMutex-COL-02-04
FORMULA_NAME DatabaseWithMutex-COL-02-05
FORMULA_NAME DatabaseWithMutex-COL-02-06
FORMULA_NAME DatabaseWithMutex-COL-02-07
FORMULA_NAME DatabaseWithMutex-COL-02-08
FORMULA_NAME DatabaseWithMutex-COL-02-09
FORMULA_NAME DatabaseWithMutex-COL-02-10
FORMULA_NAME DatabaseWithMutex-COL-02-11
FORMULA_NAME DatabaseWithMutex-COL-02-12
FORMULA_NAME DatabaseWithMutex-COL-02-13
FORMULA_NAME DatabaseWithMutex-COL-02-14
FORMULA_NAME DatabaseWithMutex-COL-02-15
=== Now, execution of the tool begins
BK_START 1590103659059
[2020-05-21 23:27:40] [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-21 23:27:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 23:27:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-21 23:27:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 515 ms
[2020-05-21 23:27:41] [INFO ] sort/places :
site->all_active,all_passive,
file->Mutex,
SF->RecBuff,Active,Message,Modify,MesBuffReply,Acknowledge,updating,WaitMutex,
[2020-05-21 23:27:41] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 13 ms.
[2020-05-21 23:27:41] [INFO ] Computed order based on color domains.
[2020-05-21 23:27:41] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions in 16 ms.
[2020-05-21 23:27:41] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 164 ms. (steps per millisecond=609 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 32 rows 38 cols
[2020-05-21 23:27:41] [INFO ] Computed 10 place invariants in 7 ms
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-21 23:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
[2020-05-21 23:27:41] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-21 23:27:41] [INFO ] Flatten gal took : 20 ms
FORMULA DatabaseWithMutex-COL-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 23:27:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-21 23:27:41] [INFO ] Flatten gal took : 6 ms
[2020-05-21 23:27:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DatabaseWithMutex-COL-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 23:27:41] [INFO ] Applying decomposition
[2020-05-21 23:27:41] [INFO ] Flatten gal took : 5 ms
[2020-05-21 23:27:41] [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/graph17467484375676162301.txt, -o, /tmp/graph17467484375676162301.bin, -w, /tmp/graph17467484375676162301.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/graph17467484375676162301.bin, -l, -1, -v, -w, /tmp/graph17467484375676162301.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-21 23:27:41] [INFO ] Computed 10 place invariants in 2 ms
inv : -RecBuff_3 + Active_1 - Message_3 - MesBuffReply_3 - Acknowledge_3 - updating_3 = 0
inv : -RecBuff_1 - RecBuff_3 - all_active_0 - all_active_1 + Mutex_0 - Message_1 - Message_3 - Modify_1 - Modify_3 - MesBuffReply_1 - MesBuffReply_3 - Acknowledge_1 - Acknowledge_3 - updating_1 - updating_3 - WaitMutex_0 - WaitMutex_1 - WaitMutex_2 - WaitMutex_3 = -1
inv : all_passive_0 + updating_0 + updating_1 = 1
inv : RecBuff_0 + RecBuff_1 + all_active_1 + Message_0 + Message_1 + Modify_2 + Modify_3 + MesBuffReply_0 + MesBuffReply_1 + Acknowledge_0 + Acknowledge_1 + updating_0 + updating_1 + WaitMutex_2 + WaitMutex_3 = 1
inv : RecBuff_1 + all_active_1 + Active_2 + Message_1 + Modify_2 + Modify_3 + MesBuffReply_1 + Acknowledge_1 + updating_1 + WaitMutex_2 + WaitMutex_3 = 1
inv : RecBuff_1 + RecBuff_3 + Mutex_1 + Message_1 + Message_3 + Modify_1 + Modify_3 + MesBuffReply_1 + MesBuffReply_3 + Acknowledge_1 + Acknowledge_3 + updating_1 + updating_3 = 1
inv : RecBuff_2 + RecBuff_3 + all_active_0 + Message_2 + Message_3 + Modify_0 + Modify_1 + MesBuffReply_2 + MesBuffReply_3 + Acknowledge_2 + Acknowledge_3 + updating_2 + updating_3 + WaitMutex_0 + WaitMutex_1 = 1
inv : -RecBuff_1 + Active_3 - Message_1 - MesBuffReply_1 - Acknowledge_1 - updating_1 = 0
inv : all_passive_1 + updating_2 + updating_3 = 1
inv : RecBuff_3 + all_active_0 + Active_0 + Message_3 + Modify_0 + Modify_1 + MesBuffReply_3 + Acknowledge_3 + updating_3 + WaitMutex_0 + WaitMutex_1 = 1
Total of 10 invariants.
[2020-05-21 23:27:41] [INFO ] Computed 10 place invariants in 3 ms
[2020-05-21 23:27:41] [INFO ] Decomposing Gal with order
[2020-05-21 23:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 23:27:41] [INFO ] Removed a total of 12 redundant transitions.
[2020-05-21 23:27:41] [INFO ] Flatten gal took : 33 ms
[2020-05-21 23:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2020-05-21 23:27:42] [INFO ] Proved 38 variables to be positive in 85 ms
[2020-05-21 23:27:42] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2020-05-21 23:27:42] [INFO ] Computation of disable matrix completed :0/32 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 23:27:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 23:27:42] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2020-05-21 23:27:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 23:27:42] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-21 23:27:42] [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 11 LTL properties
Checking formula 0 : !((X(F(((G("((((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3)>=1)"))||("((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)<=(((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3))"))U(F("((((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3)>=1)"))))))
Formula 0 simplified : !XF(("((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)<=(((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3))" | G"((((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3)>=1)") U F"((((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3)>=1)")
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
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.031165,16716,1,0,6,3089,20,0,831,849,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X(X(X(!(F(X(X("((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)>=2)"))))))))))
Formula 1 simplified : XXX!FXX"((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)>=2)"
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.051223,17800,1,0,34,6696,29,9,842,8417,76
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("(((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)>=2)&&((((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3)>=0))")))
Formula 2 simplified : !F"(((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)>=2)&&((((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3)>=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.060888,18064,1,0,51,7854,38,21,862,10687,150
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(F("((((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3)>(((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3))")))))
Formula 3 simplified : !FXF"((((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3)>(((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3))"
3 unique states visited
3 strongly connected components in search stack
3 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.068511,18324,1,0,71,8927,47,33,890,12872,214
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(G(!((G(F(G("((((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3)<=(((gi1.gu3.Modify_0+gi1.gu3.Modify_1)+gi1.gu3.Modify_2)+gi1.gu3.Modify_3))"))))U((F(G("((((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3)<=(gi2.gu4.all_active_0+gi2.gu4.all_active_1))")))||("((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)<=(((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3))"))))))))
Formula 4 simplified : !GFG!(GFG"((((gi1.gu8.WaitMutex_0+gi1.gu8.WaitMutex_1)+gi1.gu8.WaitMutex_2)+gi1.gu8.WaitMutex_3)<=(((gi1.gu3.Modify_0+gi1.gu3.Modify_1)+gi1.gu3.Modify_2)+gi1.gu3.Modify_3))" U ("((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)<=(((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3))" | FG"((((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3)<=(gi2.gu4.all_active_0+gi2.gu4.all_active_1))"))
9 unique states visited
2 strongly connected components in search stack
9 transitions explored
9 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.084432,19760,1,0,98,10611,62,39,1003,15171,323
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(X(X((X((G("((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)>=1)"))||("((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)<1)")))||("((((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3)>(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))")))))))
Formula 5 simplified : !GXXX("((((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3)>(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))" | X("((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)<1)" | G"((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)>=1)"))
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 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.098012,21092,1,0,146,12091,90,55,1068,18192,440
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G((!((F("((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))"))U("((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)>=1)")))||("((gu6.all_passive_0+gu6.all_passive_1)<2)")))&&(F(("((gu0.Mutex_0+gu0.Mutex_1)<=(((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3))")U(G("((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)>=1)"))))))
Formula 6 simplified : !(G("((gu6.all_passive_0+gu6.all_passive_1)<2)" | !(F"((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))" U "((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)>=1)")) & F("((gu0.Mutex_0+gu0.Mutex_1)<=(((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3))" U G"((((gu1.Active_0+gu1.Active_1)+gu1.Active_2)+gu1.Active_3)>=1)"))
5 unique states visited
4 strongly connected components in search stack
5 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.105243,21808,1,0,154,12295,124,58,1121,18487,485
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X((((!(X("((((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))")))U("((((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))"))&&(F("((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)<=(((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3))")))U((G("((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)<=(((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3))"))U("((gi2.gu4.all_active_0+gi2.gu4.all_active_1)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))"))))))
Formula 7 simplified : !XX(((!X"((((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))" U "((((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))") & F"((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)<=(((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3))") U (G"((((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3)<=(((gi2.gu4.MesBuffReply_0+gi2.gu4.MesBuffReply_1)+gi2.gu4.MesBuffReply_2)+gi2.gu4.MesBuffReply_3))" U "((gi2.gu4.all_active_0+gi2.gu4.all_active_1)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))"))
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 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.118155,22028,1,0,168,12636,152,64,1216,19241,554
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(G("((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)>(((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3))")))))
Formula 8 simplified : !GFG"((((gi4.gu2.Message_0+gi4.gu2.Message_1)+gi4.gu2.Message_2)+gi4.gu2.Message_3)>(((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3))"
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.137062,22524,1,0,202,15205,165,84,1266,26169,658
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(X((("((((gi1.gu3.Modify_0+gi1.gu3.Modify_1)+gi1.gu3.Modify_2)+gi1.gu3.Modify_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))")U(G("((((gi1.gu3.Modify_0+gi1.gu3.Modify_1)+gi1.gu3.Modify_2)+gi1.gu3.Modify_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))")))||("((((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3)<=(((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3))"))))))
Formula 9 simplified : !XGX("((((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3)<=(((gi4.gu7.updating_0+gi4.gu7.updating_1)+gi4.gu7.updating_2)+gi4.gu7.updating_3))" | ("((((gi1.gu3.Modify_0+gi1.gu3.Modify_1)+gi1.gu3.Modify_2)+gi1.gu3.Modify_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))" U G"((((gi1.gu3.Modify_0+gi1.gu3.Modify_1)+gi1.gu3.Modify_2)+gi1.gu3.Modify_3)<=(((gi2.gu5.Acknowledge_0+gi2.gu5.Acknowledge_1)+gi2.gu5.Acknowledge_2)+gi2.gu5.Acknowledge_3))"))
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 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.175579,24104,1,0,297,20762,182,124,1363,38518,907
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(G(F(X("((gu0.Mutex_0+gu0.Mutex_1)>(((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3))")))))))
Formula 10 simplified : !XFGFX"((gu0.Mutex_0+gu0.Mutex_1)>(((gu0.RecBuff_0+gu0.RecBuff_1)+gu0.RecBuff_2)+gu0.RecBuff_3))"
3 unique states visited
3 strongly connected components in search stack
4 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.179005,24368,1,0,304,21167,191,125,1384,39190,935
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 23:27:42] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 8) 1) (>= (select s0 24) 1)) (= (store (store (store (store s0 8 (- (select s0 8) 1)) 24 (- (select s0 24) 1)) 5 (+ (select s0 5) 1)) 10 (+ (select s0 10) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 8) 1) (>= (select s0 24) 1)) (= (store (store (store (store s0 8 (- (select s0 8) 1)) 24 (- (select s0 24) 1)) 5 (+ (select s0 5) 1)) 10 (+ (select s0 10) 1)) s1))")
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-21 23:27:42] [INFO ] Built C files in 377ms 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 1590103662414
--------------------
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-COL-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-COL-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-158922814000225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-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 '
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 ;