Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564600189.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564600189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 18:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:52 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 ShieldRVt-PT-001B-00
FORMULA_NAME ShieldRVt-PT-001B-01
FORMULA_NAME ShieldRVt-PT-001B-02
FORMULA_NAME ShieldRVt-PT-001B-03
FORMULA_NAME ShieldRVt-PT-001B-04
FORMULA_NAME ShieldRVt-PT-001B-05
FORMULA_NAME ShieldRVt-PT-001B-06
FORMULA_NAME ShieldRVt-PT-001B-07
FORMULA_NAME ShieldRVt-PT-001B-08
FORMULA_NAME ShieldRVt-PT-001B-09
FORMULA_NAME ShieldRVt-PT-001B-10
FORMULA_NAME ShieldRVt-PT-001B-11
FORMULA_NAME ShieldRVt-PT-001B-12
FORMULA_NAME ShieldRVt-PT-001B-13
FORMULA_NAME ShieldRVt-PT-001B-14
FORMULA_NAME ShieldRVt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1621239453172

Running Version 0
[2021-05-17 08:17:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 08:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 08:17:36] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-17 08:17:36] [INFO ] Transformed 53 places.
[2021-05-17 08:17:36] [INFO ] Transformed 53 transitions.
[2021-05-17 08:17:36] [INFO ] Found NUPN structural information;
[2021-05-17 08:17:36] [INFO ] Parsed PT model containing 53 places and 53 transitions in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 08:17:36] [INFO ] Initial state test concluded for 4 properties.
FORMULA ShieldRVt-PT-001B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 49
Applied a total of 8 rules in 28 ms. Remains 49 /53 variables (removed 4) and now considering 49/53 (removed 4) transitions.
// Phase 1: matrix 49 rows 49 cols
[2021-05-17 08:17:36] [INFO ] Computed 5 place invariants in 11 ms
[2021-05-17 08:17:36] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 49 rows 49 cols
[2021-05-17 08:17:36] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 08:17:37] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
// Phase 1: matrix 49 rows 49 cols
[2021-05-17 08:17:37] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 08:17:37] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/53 places, 49/53 transitions.
[2021-05-17 08:17:37] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 08:17:37] [INFO ] Flatten gal took : 65 ms
FORMULA ShieldRVt-PT-001B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 08:17:37] [INFO ] Flatten gal took : 18 ms
[2021-05-17 08:17:37] [INFO ] Input system was already deterministic with 49 transitions.
Incomplete random walk after 100000 steps, including 104 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 19) seen :17
Running SMT prover for 2 properties.
// Phase 1: matrix 49 rows 49 cols
[2021-05-17 08:17:37] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-17 08:17:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 08:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:17:38] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-17 08:17:38] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 7 ms to minimize.
[2021-05-17 08:17:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2021-05-17 08:17:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 165 ms
[2021-05-17 08:17:38] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-17 08:17:38] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldRVt-PT-001B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X((F(G(p1))||(X(X(p2)) U (p0&&X(X(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 49 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 49/49 places, 49/49 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 43 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 43 transition count 43
Applied a total of 12 rules in 4 ms. Remains 43 /49 variables (removed 6) and now considering 43/49 (removed 6) transitions.
// Phase 1: matrix 43 rows 43 cols
[2021-05-17 08:17:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 08:17:38] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 43 rows 43 cols
[2021-05-17 08:17:38] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-17 08:17:38] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 43 cols
[2021-05-17 08:17:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 08:17:38] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/49 places, 43/49 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-001B-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s34 1), p1:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null][false]]
Product exploration explored 100000 steps with 11587 reset in 554 ms.
Product exploration explored 100000 steps with 11617 reset in 332 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11599 reset in 158 ms.
Product exploration explored 100000 steps with 11564 reset in 205 ms.
Applying partial POR strategy [true]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 43/43 places, 43/43 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 43 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 43 transition count 42
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 11 place count 43 transition count 46
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 18 place count 43 transition count 46
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 39 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 39 transition count 42
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 39 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 34 transition count 37
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 34 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 34 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 31 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 31 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 63 place count 31 transition count 42
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 63 rules in 31 ms. Remains 31 /43 variables (removed 12) and now considering 42/43 (removed 1) transitions.
[2021-05-17 08:17:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2021-05-17 08:17:40] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 08:17:40] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/43 places, 42/43 transitions.
Product exploration explored 100000 steps with 26629 reset in 371 ms.
Product exploration explored 100000 steps with 26639 reset in 182 ms.
Starting structural reductions, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 40 transition count 40
Applied a total of 6 rules in 6 ms. Remains 40 /43 variables (removed 3) and now considering 40/43 (removed 3) transitions.
// Phase 1: matrix 40 rows 40 cols
[2021-05-17 08:17:41] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 08:17:41] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2021-05-17 08:17:41] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-17 08:17:41] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 40 cols
[2021-05-17 08:17:41] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 08:17:41] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/43 places, 40/43 transitions.
[2021-05-17 08:17:41] [INFO ] Flatten gal took : 9 ms
[2021-05-17 08:17:41] [INFO ] Flatten gal took : 6 ms
[2021-05-17 08:17:41] [INFO ] Time to serialize gal into /tmp/LTL13367276053056457887.gal : 3 ms
[2021-05-17 08:17:41] [INFO ] Time to serialize properties into /tmp/LTL8563080481745261284.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13367276053056457887.gal, -t, CGAL, -LTL, /tmp/LTL8563080481745261284.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13367276053056457887.gal -t CGAL -LTL /tmp/LTL8563080481745261284.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((F(("(p41==1)")||(X((F(G("(p18==1)")))||((X(X("(p5==1)")))U(("(p41==1)")&&(X(X("(p5==1)"))))))))))
Formula 0 simplified : !F("(p41==1)" | X(FG"(p18==1)" | (XX"(p5==1)" U ("(p41==1)" & XX"(p5==1)"))))
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t10, t15, t16, t20, t22, t23, t26, t30, t32, t35, t40, t42, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/35/14/49
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.163585,20852,1,0,203,21601,133,120,1325,22638,345
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(G("(p4==1)"))))
Formula 1 simplified : !XG"(p4==1)"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.216626,22688,1,0,217,27058,145,152,1400,31995,414
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X("(p38==1)"))||(G("(p5!=1)"))))
Formula 2 simplified : !(X"(p38==1)" | G"(p5!=1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.218849,22880,1,0,217,27058,159,152,1408,31997,427
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X(X(X((F(G("(p14!=1)")))||(G("(p45!=1)"))))))))
Formula 3 simplified : !XXXX(FG"(p14!=1)" | G"(p45!=1)")
Computing Next relation with stutter on 1 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
35 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.578007,35080,1,0,565,92462,178,469,1412,133820,1160
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(F("(p5!=1)"))))
Formula 4 simplified : !XF"(p5!=1)"
Computing Next relation with stutter on 1 deadlock states
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.578776,35344,1,0,565,92462,184,469,1412,133820,1164
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F(("(p8==1)")&&(F("((p4==1)||(p8==1))"))))))
Formula 5 simplified : !XF("(p8==1)" & F"((p4==1)||(p8==1))")
Computing Next relation with stutter on 1 deadlock states
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 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.612253,36120,1,0,659,96539,194,539,1418,139795,1371
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(G(("(p45==1)")||(X(F(("(p45==1)")&&(F("(p49==0)")))))))))
Formula 6 simplified : !FG("(p45==1)" | XF("(p45==1)" & F"(p49==0)"))
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
7 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.688969,37712,1,0,737,102421,199,641,1422,150116,1687
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(G("(p21==1)"))))
Formula 7 simplified : !FG"(p21==1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
41 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,1.0878,49888,1,0,1044,167061,212,910,1424,247159,2374
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F("(p8==1)")))
Formula 8 simplified : !F"(p8==1)"
Computing Next relation with stutter on 1 deadlock states
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,1.09821,50152,1,0,1120,168486,216,962,1424,249342,2521
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((G("(p21==0)"))&&((F("(p48!=1)"))||(G("(p33==0)")))))
Formula 9 simplified : !(G"(p21==0)" & (F"(p48!=1)" | G"(p33==0)"))
Computing Next relation with stutter on 1 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
11 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,1.20622,53672,1,0,1289,181520,241,1150,1442,274302,2970
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(("((p36==1)||((p32==0)&&(((p17==0)||(p23==0))||(p39==0))))")||(("(((p17==1)&&(p23==1))&&(p39==1))")U("(p36==1)")))))
Formula 10 simplified : !G("((p36==1)||((p32==0)&&(((p17==0)||(p23==0))||(p39==0))))" | ("(((p17==1)&&(p23==1))&&(p39==1))" U "(p36==1)"))
Computing Next relation with stutter on 1 deadlock states
49 unique states visited
49 strongly connected components in search stack
50 transitions explored
49 items max in DFS search stack
52 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,1.72971,67348,1,0,1632,244057,266,1479,1486,365318,3791
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-001B-00 finished in 5212 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621239464602

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldRVt-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 ShieldRVt-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-smll-162106564600189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001B.tgz
mv ShieldRVt-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;