Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231000474.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is Peterson-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231000474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.9K Feb 12 04:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 12 04:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 03:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 8 03:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 07:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 07:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 42K Mar 10 17:31 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 Peterson-COL-2-LTLCardinality-00
FORMULA_NAME Peterson-COL-2-LTLCardinality-01
FORMULA_NAME Peterson-COL-2-LTLCardinality-02
FORMULA_NAME Peterson-COL-2-LTLCardinality-03
FORMULA_NAME Peterson-COL-2-LTLCardinality-04
FORMULA_NAME Peterson-COL-2-LTLCardinality-05
FORMULA_NAME Peterson-COL-2-LTLCardinality-06
FORMULA_NAME Peterson-COL-2-LTLCardinality-07
FORMULA_NAME Peterson-COL-2-LTLCardinality-08
FORMULA_NAME Peterson-COL-2-LTLCardinality-09
FORMULA_NAME Peterson-COL-2-LTLCardinality-10
FORMULA_NAME Peterson-COL-2-LTLCardinality-11
FORMULA_NAME Peterson-COL-2-LTLCardinality-12
FORMULA_NAME Peterson-COL-2-LTLCardinality-13
FORMULA_NAME Peterson-COL-2-LTLCardinality-14
FORMULA_NAME Peterson-COL-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553665690658

05:48:38.617 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
05:48:38.619 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X("(((CS_0+CS_1)+CS_2)>=3)")))))
Formula 0 simplified : !XXX"(((CS_0+CS_1)+CS_2)>=3)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 132
// Phase 1: matrix 132 rows 108 cols
invariant :-1'wantSection_3 + askForSection_2 + askForSection_3 + testTurn_2 + testTurn_3 + beginLoop_6 + beginLoop_7 + beginLoop_8 + beginLoop_9 + beginLoop_10 + beginLoop_11 + endTurn_2 + endTurn_3 + CS_1 + testIdentity_6 + testIdentity_7 + testIdentity_8 + testIdentity_9 + testIdentity_10 + testIdentity_11 + testAlone_6 + testAlone_7 + testAlone_8 + testAlone_9 + testAlone_10 + testAlone_11 + isEndLoop_6 + isEndLoop_7 + isEndLoop_8 + isEndLoop_9 + isEndLoop_10 + isEndLoop_11 = 0
invariant :wantSection_4 + wantSection_5 = 1
invariant :turn_0 + turn_1 + turn_2 = 1
invariant :wantSection_2 + wantSection_3 = 1
invariant :idle_1 + wantSection_3 = 1
invariant :-1'wantSection_1 + askForSection_0 + askForSection_1 + testTurn_0 + testTurn_1 + beginLoop_0 + beginLoop_1 + beginLoop_2 + beginLoop_3 + beginLoop_4 + beginLoop_5 + endTurn_0 + endTurn_1 + CS_0 + testIdentity_0 + testIdentity_1 + testIdentity_2 + testIdentity_3 + testIdentity_4 + testIdentity_5 + testAlone_0 + testAlone_1 + testAlone_2 + testAlone_3 + testAlone_4 + testAlone_5 + isEndLoop_0 + isEndLoop_1 + isEndLoop_2 + isEndLoop_3 + isEndLoop_4 + isEndLoop_5 = 0
invariant :-1'wantSection_5 + askForSection_4 + askForSection_5 + testTurn_4 + testTurn_5 + beginLoop_12 + beginLoop_13 + beginLoop_14 + beginLoop_15 + beginLoop_16 + beginLoop_17 + endTurn_4 + endTurn_5 + CS_2 + testIdentity_12 + testIdentity_13 + testIdentity_14 + testIdentity_15 + testIdentity_16 + testIdentity_17 + testAlone_12 + testAlone_13 + testAlone_14 + testAlone_15 + testAlone_16 + testAlone_17 + isEndLoop_12 + isEndLoop_13 + isEndLoop_14 + isEndLoop_15 + isEndLoop_16 + isEndLoop_17 = 0
invariant :idle_0 + wantSection_1 = 1
invariant :idle_2 + wantSection_5 = 1
invariant :wantSection_0 + wantSection_1 = 1
invariant :turn_3 + turn_4 + turn_5 = 1
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, t47, t98, t101, t103, t107, t110, t112, t132, t133, t134, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :12/96/30/138
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
200 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,2.04568,75088,1,0,258,175885,290,129,3294,191603,294
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G(F(F("(((idle_0+idle_1)+idle_2)<=(((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5))"))))))
Formula 1 simplified : !GF"(((idle_0+idle_1)+idle_2)<=(((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
85 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,2.89382,92584,1,0,298,219973,299,130,3372,231344,404
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17)>=1)")U(X(G("((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)>=2)")))))
Formula 2 simplified : !("((((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17)>=1)" U XG"((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)>=2)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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,3.04725,94112,1,0,298,221167,313,130,3417,233613,416
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=((idle_0+idle_1)+idle_2))")U("(((CS_0+CS_1)+CS_2)>=3)"))U(("((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)<=(((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5))")U("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)>=3)"))))
Formula 3 simplified : !(("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=((idle_0+idle_1)+idle_2))" U "(((CS_0+CS_1)+CS_2)>=3)") U ("((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)<=(((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5))" U "((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)>=3)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
367 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,6.7237,184296,1,0,472,496072,351,201,3690,657696,793
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(G("(((CS_0+CS_1)+CS_2)<=(((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5))")))))
Formula 4 simplified : !GXG"(((CS_0+CS_1)+CS_2)<=(((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
287 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,9.5881,253172,1,0,638,724809,357,259,3804,975765,1107
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(G(F("((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)<=(((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17))"))))))
Formula 5 simplified : !XGF"((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)<=(((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
69 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,10.2735,271912,1,0,668,779755,366,260,4110,1.03556e+06,1192
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)>=2)"))))
Formula 6 simplified : !XF"((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
294 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.2216,337120,1,0,780,928414,375,306,4197,1.27663e+06,1482
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((X("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=3)"))U(X("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=((CS_0+CS_1)+CS_2))")))))
Formula 7 simplified : !G(X"((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=3)" U X"((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=((CS_0+CS_1)+CS_2))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
36 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.5807,347640,1,0,782,948631,382,306,4399,1.30936e+06,1489
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)>=2)")))
Formula 8 simplified : !G"((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)>=2)"
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,13.5877,347900,1,0,782,948631,382,306,4403,1.30936e+06,1494
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)<=(((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5))")U("(((CS_0+CS_1)+CS_2)<=(((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17))"))U(G(X("((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)<=(((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17))")))))
Formula 9 simplified : !(("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)<=(((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5))" U "(((CS_0+CS_1)+CS_2)<=(((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17))") U GX"((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)<=(((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17))")
18 unique states visited
18 strongly connected components in search stack
20 transitions explored
18 items max in DFS search stack
463 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,18.2233,440076,1,0,935,1.32031e+06,402,348,4914,1.84551e+06,1843
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=(((((wantSection_0+wantSection_1)+wantSection_2)+wantSection_3)+wantSection_4)+wantSection_5))")U("((((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17)>=3)")))))
Formula 10 simplified : !G("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=(((((wantSection_0+wantSection_1)+wantSection_2)+wantSection_3)+wantSection_4)+wantSection_5))" U "((((((((((((((((((isEndLoop_0+isEndLoop_1)+isEndLoop_2)+isEndLoop_3)+isEndLoop_4)+isEndLoop_5)+isEndLoop_6)+isEndLoop_7)+isEndLoop_8)+isEndLoop_9)+isEndLoop_10)+isEndLoop_11)+isEndLoop_12)+isEndLoop_13)+isEndLoop_14)+isEndLoop_15)+isEndLoop_16)+isEndLoop_17)>=3)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
69 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,18.9152,462768,1,0,1004,1.35192e+06,420,412,5087,1.90167e+06,2189
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G("(((idle_0+idle_1)+idle_2)>=1)")))
Formula 11 simplified : !G"(((idle_0+idle_1)+idle_2)>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
58 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,19.4873,479400,1,0,1151,1.40183e+06,426,463,5098,1.97749e+06,2530
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(X(F(F("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=3)"))))))
Formula 12 simplified : !FXF"((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=3)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 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,19.55,481512,1,0,1152,1.40222e+06,433,464,5098,1.9784e+06,2709
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((true))
Formula 13 simplified : 0
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,19.5501,481512,1,0,1152,1.40222e+06,433,464,5098,1.9784e+06,2709
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F(X("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)>=3)")))U(G(G("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)>=2)")))))
Formula 14 simplified : !(FX"((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)>=3)" U G"((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)>=2)")
2 unique states visited
2 strongly connected components in search stack
2 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,19.5879,482564,1,0,1155,1.40434e+06,439,464,5136,1.98002e+06,2727
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(("((((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17)>=1)")U(F("(((idle_0+idle_1)+idle_2)<=((CS_0+CS_1)+CS_2))")))))
Formula 15 simplified : !X("((((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17)>=1)" U F"(((idle_0+idle_1)+idle_2)<=((CS_0+CS_1)+CS_2))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
23 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,19.8242,489956,1,0,1259,1.41888e+06,448,515,5162,2.00853e+06,3003
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1553665743666

--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 27, 2019 5:48:14 AM fr.lip6.move.gal.application.Application start
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]
Mar 27, 2019 5:48:14 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 5:48:14 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 27, 2019 5:48:38 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24848 ms
Mar 27, 2019 5:48:38 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 places.
Mar 27, 2019 5:48:38 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 27, 2019 5:48:38 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
ProcTour->askForSection,testTurn,endTurn,
TourProc->turn,
Process->idle,CS,

Mar 27, 2019 5:48:38 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 14 transitions.
Mar 27, 2019 5:48:38 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 27, 2019 5:48:39 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 4 ms
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 19.0 instantiations of transitions. Total transitions/syncs built is 142
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.instantiate.Simplifier removeUncalledTransitions
INFO: Removed 3 uncalled transitions from type Peterson_COL_2
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 115 ms
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 49 ms
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 136 transitions. Expanding to a total of 139 deterministic transitions.
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 41 ms.
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 108 places.
Mar 27, 2019 5:48:39 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 138 transitions.
Mar 27, 2019 5:48:40 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 136 transitions. Expanding to a total of 139 deterministic transitions.
Mar 27, 2019 5:48:40 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 1 ms.
Mar 27, 2019 5:48:40 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
Mar 27, 2019 5:48:40 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 27, 2019 5:48:40 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 27 ms
Mar 27, 2019 5:48:42 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 108 variables to be positive in 1774 ms
Mar 27, 2019 5:48:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 138 transitions.
Mar 27, 2019 5:48:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/138 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 5:48:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 5:48:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 138 transitions.
Mar 27, 2019 5:48:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 5:48:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 138 transitions.
Mar 27, 2019 5:48:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/138) took 98 ms. Total solver calls (SAT/UNSAT): 13(6/7)
Mar 27, 2019 5:48:52 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(16/138) took 3168 ms. Total solver calls (SAT/UNSAT): 818(664/154)
Mar 27, 2019 5:48:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(27/138) took 6201 ms. Total solver calls (SAT/UNSAT): 1343(1126/217)
Mar 27, 2019 5:48:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(43/138) took 9619 ms. Total solver calls (SAT/UNSAT): 1963(1726/237)
Mar 27, 2019 5:49:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(48/138) took 13264 ms. Total solver calls (SAT/UNSAT): 2145(1806/339)
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 27, 2019 5:49:03 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 23188ms conformant to PINS in folder :/home/mcc/execution

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="Peterson-COL-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
echo " Input is Peterson-COL-2, 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 r197-oct2-155272231000474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; 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
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 ;