fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r362-smll-167891812800415
Last Updated
May 14, 2023

About the Execution of Marcie+red for SemanticWebServices-PT-S128P18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9784.252 3600000.00 3636269.00 10686.90 FFTTTTFT?TFFFFT? normal

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.r362-smll-167891812800415.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 marciexred
Input is SemanticWebServices-PT-S128P18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812800415
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 261K 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 SemanticWebServices-PT-S128P18-ReachabilityFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679165195852

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 18:46:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 18:46:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:46:39] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-18 18:46:39] [INFO ] Transformed 184 places.
[2023-03-18 18:46:39] [INFO ] Transformed 466 transitions.
[2023-03-18 18:46:39] [INFO ] Parsed PT model containing 184 places and 466 transitions and 1873 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 269 transitions
Reduce redundant transitions removed 269 transitions.
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 8) seen :5
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 18:46:40] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
// Phase 1: matrix 186 rows 182 cols
[2023-03-18 18:46:40] [INFO ] Computed 51 place invariants in 35 ms
[2023-03-18 18:46:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 18:46:40] [INFO ] [Real]Absence check using 2 positive and 49 generalized place invariants in 21 ms returned sat
[2023-03-18 18:46:41] [INFO ] After 178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-18 18:46:41] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-18 18:46:41] [INFO ] After 37ms SMT Verify possible using 93 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 18:46:41] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 18:46:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 18:46:41] [INFO ] [Nat]Absence check using 2 positive and 49 generalized place invariants in 19 ms returned sat
[2023-03-18 18:46:41] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 18:46:41] [INFO ] After 91ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-18 18:46:41] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-18 18:46:41] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA SemanticWebServices-PT-S128P18-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 20 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 195/195 transitions.
Graph (complete) has 381 edges and 182 vertex of which 150 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Ensure Unique test removed 43 places
Drop transitions removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 107 transition count 112
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 137 place count 97 transition count 102
Iterating global reduction 1 with 10 rules applied. Total rules applied 147 place count 97 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 149 place count 97 transition count 100
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 91 transition count 94
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 91 transition count 94
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 166 place count 86 transition count 89
Iterating global reduction 2 with 5 rules applied. Total rules applied 171 place count 86 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 175 place count 82 transition count 85
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 82 transition count 85
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 78 transition count 81
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 78 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 77 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 77 transition count 80
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 2 with 2 rules applied. Total rules applied 191 place count 76 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 192 place count 75 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 75 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 195 place count 73 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 197 place count 73 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 199 place count 71 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 71 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 204 place count 68 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 207 place count 68 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 210 place count 65 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 213 place count 65 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 217 place count 61 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 221 place count 61 transition count 64
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 223 place count 59 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 225 place count 59 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 226 place count 58 transition count 61
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 58 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 58 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 229 place count 58 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 57 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 56 transition count 58
Applied a total of 231 rules in 141 ms. Remains 56 /182 variables (removed 126) and now considering 58/195 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 56/182 places, 58/195 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 333324 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333324 steps, saw 310396 distinct states, run finished after 3003 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 18:46:45] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
// Phase 1: matrix 50 rows 56 cols
[2023-03-18 18:46:45] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-18 18:46:45] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 18:46:45] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-18 18:46:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-18 18:46:45] [INFO ] After 17ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 18:46:45] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 18:46:45] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 18:46:45] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 18:46:45] [INFO ] After 16ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 18:46:45] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 18:46:45] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 58/58 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 56/56 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-18 18:46:45] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
[2023-03-18 18:46:45] [INFO ] Invariant cache hit.
[2023-03-18 18:46:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 18:46:45] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
[2023-03-18 18:46:45] [INFO ] Invariant cache hit.
[2023-03-18 18:46:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-18 18:46:45] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-18 18:46:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 18:46:45] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
[2023-03-18 18:46:45] [INFO ] Invariant cache hit.
[2023-03-18 18:46:45] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 56/56 places, 58/58 transitions.
Graph (complete) has 5 edges and 56 vertex of which 24 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 24 transition count 18
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 24 transition count 18
Applied a total of 43 rules in 2 ms. Remains 24 /56 variables (removed 32) and now considering 18/58 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 24 cols
[2023-03-18 18:46:45] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-18 18:46:45] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 18:46:45] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-18 18:46:45] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 18:46:45] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 18:46:45] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 18:46:45] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 18:46:45] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-18 18:46:45] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 18:46:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-18 18:46:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 56 places, 58 transitions and 193 arcs took 2 ms.
[2023-03-18 18:46:46] [INFO ] Flatten gal took : 34 ms
Total runtime 7046 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: _10_ont_128_18_net
(NrP: 56 NrTr: 58 NrArc: 193)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 3.319sec


before gc: list nodes free: 403126

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391

before gc: list nodes free: 402470

after gc: idd nodes used:138, unused:63999862; list nodes free:278920391
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6361732 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098900 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83

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="SemanticWebServices-PT-S128P18"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is SemanticWebServices-PT-S128P18, 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 r362-smll-167891812800415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S128P18.tgz
mv SemanticWebServices-PT-S128P18 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 ;