Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r267-smll-167863541800431.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Parking-PT-416, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541800431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K Mar 5 18:23 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 Parking-PT-416-ReachabilityFireability-00
FORMULA_NAME Parking-PT-416-ReachabilityFireability-01
FORMULA_NAME Parking-PT-416-ReachabilityFireability-02
FORMULA_NAME Parking-PT-416-ReachabilityFireability-03
FORMULA_NAME Parking-PT-416-ReachabilityFireability-04
FORMULA_NAME Parking-PT-416-ReachabilityFireability-05
FORMULA_NAME Parking-PT-416-ReachabilityFireability-06
FORMULA_NAME Parking-PT-416-ReachabilityFireability-07
FORMULA_NAME Parking-PT-416-ReachabilityFireability-08
FORMULA_NAME Parking-PT-416-ReachabilityFireability-09
FORMULA_NAME Parking-PT-416-ReachabilityFireability-10
FORMULA_NAME Parking-PT-416-ReachabilityFireability-11
FORMULA_NAME Parking-PT-416-ReachabilityFireability-12
FORMULA_NAME Parking-PT-416-ReachabilityFireability-13
FORMULA_NAME Parking-PT-416-ReachabilityFireability-14
FORMULA_NAME Parking-PT-416-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678874783291

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 10:06:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 10:06:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:06:26] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-15 10:06:26] [INFO ] Transformed 305 places.
[2023-03-15 10:06:26] [INFO ] Transformed 433 transitions.
[2023-03-15 10:06:26] [INFO ] Found NUPN structural information;
[2023-03-15 10:06:26] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 825 ms. (steps per millisecond=12 ) properties (out of 16) seen :8
FORMULA Parking-PT-416-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :1
FORMULA Parking-PT-416-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 257 rows 305 cols
[2023-03-15 10:06:27] [INFO ] Computed 76 place invariants in 16 ms
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 72 positive place invariants in 55 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:28] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 72 positive place invariants in 31 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:29] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-15 10:06:29] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 10:06:29] [INFO ] After 395ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-15 10:06:30] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 9 ms to minimize.
[2023-03-15 10:06:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-15 10:06:30] [INFO ] After 1030ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 295 ms.
[2023-03-15 10:06:30] [INFO ] After 2260ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA Parking-PT-416-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA Parking-PT-416-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-416-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-416-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 65 ms.
Support contains 72 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 304 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 304 transition count 256
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 300 transition count 252
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 35 place count 300 transition count 227
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 60 place count 275 transition count 227
Applied a total of 60 rules in 103 ms. Remains 275 /305 variables (removed 30) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 275/305 places, 227/257 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :1
FORMULA Parking-PT-416-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 275 cols
[2023-03-15 10:06:31] [INFO ] Computed 76 place invariants in 9 ms
[2023-03-15 10:06:31] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 10:06:31] [INFO ] [Nat]Absence check using 72 positive place invariants in 25 ms returned sat
[2023-03-15 10:06:31] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:31] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 10:06:31] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-15 10:06:32] [INFO ] After 228ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 10:06:32] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2023-03-15 10:06:32] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2023-03-15 10:06:32] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2023-03-15 10:06:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2023-03-15 10:06:32] [INFO ] After 680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-15 10:06:32] [INFO ] After 1318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Parking-PT-416-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
Support contains 44 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 227/227 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 226
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 11 place count 274 transition count 217
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 20 place count 265 transition count 217
Applied a total of 20 rules in 42 ms. Remains 265 /275 variables (removed 10) and now considering 217/227 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 265/275 places, 217/227 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667227 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667227 steps, saw 138319 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 217 rows 265 cols
[2023-03-15 10:06:35] [INFO ] Computed 76 place invariants in 8 ms
[2023-03-15 10:06:36] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:06:36] [INFO ] [Nat]Absence check using 72 positive place invariants in 24 ms returned sat
[2023-03-15 10:06:36] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-15 10:06:36] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:06:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 10:06:36] [INFO ] After 66ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:06:36] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2023-03-15 10:06:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-15 10:06:36] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-15 10:06:36] [INFO ] After 540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 44 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 217/217 transitions.
Applied a total of 0 rules in 14 ms. Remains 265 /265 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 265/265 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 217/217 transitions.
Applied a total of 0 rules in 12 ms. Remains 265 /265 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2023-03-15 10:06:36] [INFO ] Invariant cache hit.
[2023-03-15 10:06:36] [INFO ] Implicit Places using invariants in 351 ms returned [3, 4, 5, 8, 9, 10, 13, 14, 15, 22, 23, 26, 27, 34, 42, 50, 58, 74, 76, 80, 81, 82, 83, 86, 87, 88, 95, 102, 110, 118, 134, 136, 140, 141, 142, 143, 144, 145, 146, 147, 154, 162, 170, 178, 194, 201, 202, 205, 208, 209, 210, 218, 226, 234, 242, 260]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 357 ms to find 56 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/265 places, 217/217 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 209 transition count 177
Reduce places removed 40 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 47 rules applied. Total rules applied 87 place count 169 transition count 170
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 98 place count 162 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 160 transition count 166
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 100 place count 160 transition count 150
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 132 place count 144 transition count 150
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 145 place count 131 transition count 137
Iterating global reduction 4 with 13 rules applied. Total rules applied 158 place count 131 transition count 137
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 129 transition count 135
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 129 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 128 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 128 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 127 transition count 132
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 127 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 127 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 175 place count 123 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 177 place count 123 transition count 125
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 122 transition count 124
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 122 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 121 transition count 139
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 185 place count 121 transition count 135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 189 place count 117 transition count 135
Applied a total of 189 rules in 53 ms. Remains 117 /209 variables (removed 92) and now considering 135/217 (removed 82) transitions.
// Phase 1: matrix 135 rows 117 cols
[2023-03-15 10:06:37] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 10:06:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-15 10:06:37] [INFO ] Invariant cache hit.
[2023-03-15 10:06:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 10:06:37] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 117/265 places, 135/217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 674 ms. Remains : 117/265 places, 135/217 transitions.
Finished random walk after 8223 steps, including 243 resets, run visited all 1 properties in 20 ms. (steps per millisecond=411 )
FORMULA Parking-PT-416-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11203 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Parking (PT), instance 416
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 305 places, 433 transitions, 1289 arcs.
Final Score: 9610.971
Took : 15 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
FORMULA Parking-PT-416-ReachabilityFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Parking-PT-416-ReachabilityFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678874963635

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="Parking-PT-416"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Parking-PT-416, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863541800431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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