About the Execution of 2024-gold for CloudDeployment-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15683.980 | 161789.00 | 213119.00 | 504.50 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r056-tall-174854041500042.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is CloudDeployment-PT-6a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tall-174854041500042
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 317K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748644645073
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 22:37:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 22:37:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:37:26] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-05-30 22:37:26] [INFO ] Transformed 221 places.
[2025-05-30 22:37:26] [INFO ] Transformed 908 transitions.
[2025-05-30 22:37:26] [INFO ] Found NUPN structural information;
[2025-05-30 22:37:26] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 213 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 221/221 places, 908/908 transitions.
Graph (trivial) has 265 edges and 221 vertex of which 60 / 221 are part of one of the 18 SCC in 4 ms
Free SCC test removed 42 places
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 167 transition count 674
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 49 place count 149 transition count 740
Applied a total of 49 rules in 122 ms. Remains 149 /221 variables (removed 72) and now considering 740/908 (removed 168) transitions.
[2025-05-30 22:37:26] [INFO ] Flow matrix only has 324 transitions (discarded 416 similar events)
// Phase 1: matrix 324 rows 149 cols
[2025-05-30 22:37:26] [INFO ] Computed 24 invariants in 16 ms
[2025-05-30 22:37:27] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-05-30 22:37:27] [INFO ] Flow matrix only has 324 transitions (discarded 416 similar events)
[2025-05-30 22:37:27] [INFO ] Invariant cache hit.
[2025-05-30 22:37:27] [INFO ] State equation strengthened by 212 read => feed constraints.
[2025-05-30 22:37:27] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
Running 739 sub problems to find dead transitions.
[2025-05-30 22:37:27] [INFO ] Flow matrix only has 324 transitions (discarded 416 similar events)
[2025-05-30 22:37:27] [INFO ] Invariant cache hit.
[2025-05-30 22:37:27] [INFO ] State equation strengthened by 212 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 24/172 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (OVERLAPS) 323/471 variables, 148/320 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 211/531 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 6 (OVERLAPS) 1/472 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/473 variables, and 533 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30043 ms.
Refiners :[Domain max(s): 149/149 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 149/149 constraints, ReadFeed: 211/212 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 739 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 24/172 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (OVERLAPS) 323/471 variables, 148/320 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 211/531 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 739/1270 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 7 (OVERLAPS) 1/472 variables, 1/1271 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/1272 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/473 variables, and 1272 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30037 ms.
Refiners :[Domain max(s): 149/149 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 149/149 constraints, ReadFeed: 211/212 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 0/0 constraints]
After SMT, in 60970ms problems are : Problem set: 0 solved, 739 unsolved
Search for dead transitions found 0 dead transitions in 61001ms
Starting structural reductions in LIVENESS mode, iteration 1 : 149/221 places, 740/908 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62068 ms. Remains : 149/221 places, 740/908 transitions.
Discarding 562 transitions out of 740. Remains 178
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (836 resets) in 1784 ms. (22 steps per ms) remains 12/177 properties
BEST_FIRST walk for 40004 steps (95 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (64 resets) in 183 ms. (217 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 88 ms. (449 steps per ms) remains 1/11 properties
[2025-05-30 22:38:29] [INFO ] Flow matrix only has 324 transitions (discarded 416 similar events)
[2025-05-30 22:38:29] [INFO ] Invariant cache hit.
[2025-05-30 22:38:29] [INFO ] State equation strengthened by 212 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 80/87 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/148 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 323/471 variables, 148/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 211/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/472 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/473 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/473 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Domain max(s): 149/149 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 149/149 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 80/87 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/148 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 323/471 variables, 148/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 211/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/472 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/473 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/473 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Domain max(s): 149/149 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 149/149 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 740/740 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 149 transition count 611
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 139 place count 139 transition count 565
Iterating global reduction 1 with 10 rules applied. Total rules applied 149 place count 139 transition count 565
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 136 transition count 562
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 136 transition count 562
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 134 transition count 560
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 134 transition count 560
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 160 place count 133 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 161 place count 133 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 1 with 108 rules applied. Total rules applied 269 place count 133 transition count 451
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 270 place count 133 transition count 451
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 132 transition count 450
Applied a total of 271 rules in 120 ms. Remains 132 /149 variables (removed 17) and now considering 450/740 (removed 290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 132/149 places, 450/740 transitions.
RANDOM walk for 4000000 steps (54991 resets) in 9221 ms. (433 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (9237 resets) in 2919 ms. (1369 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3349020 steps, run timeout after 9001 ms. (steps per millisecond=372 ) properties seen :0 out of 1
Probabilistic random walk after 3349020 steps, saw 531356 distinct states, run finished after 9005 ms. (steps per millisecond=371 ) properties seen :0
[2025-05-30 22:38:42] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
// Phase 1: matrix 198 rows 132 cols
[2025-05-30 22:38:42] [INFO ] Computed 24 invariants in 4 ms
[2025-05-30 22:38:42] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/132 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/132 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 450/450 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 132/132 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 450/450 transitions.
Applied a total of 0 rules in 24 ms. Remains 132 /132 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2025-05-30 22:38:42] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
[2025-05-30 22:38:42] [INFO ] Invariant cache hit.
[2025-05-30 22:38:42] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 22:38:42] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
[2025-05-30 22:38:42] [INFO ] Invariant cache hit.
[2025-05-30 22:38:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 22:38:42] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2025-05-30 22:38:42] [INFO ] Redundant transitions in 30 ms returned []
Running 414 sub problems to find dead transitions.
[2025-05-30 22:38:42] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
[2025-05-30 22:38:42] [INFO ] Invariant cache hit.
[2025-05-30 22:38:42] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 164 constraints, problems are : Problem set: 0 solved, 414 unsolved in 11025 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 414/578 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 578 constraints, problems are : Problem set: 0 solved, 414 unsolved in 18733 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
After SMT, in 30197ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 30202ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30607 ms. Remains : 132/132 places, 450/450 transitions.
RANDOM walk for 4000000 steps (54975 resets) in 9367 ms. (426 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (9228 resets) in 2879 ms. (1388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3390549 steps, run timeout after 9001 ms. (steps per millisecond=376 ) properties seen :0 out of 1
Probabilistic random walk after 3390549 steps, saw 538613 distinct states, run finished after 9001 ms. (steps per millisecond=376 ) properties seen :0
[2025-05-30 22:39:25] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
[2025-05-30 22:39:25] [INFO ] Invariant cache hit.
[2025-05-30 22:39:25] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/132 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/132 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 450/450 transitions.
Applied a total of 0 rules in 25 ms. Remains 132 /132 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 132/132 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 450/450 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2025-05-30 22:39:25] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
[2025-05-30 22:39:25] [INFO ] Invariant cache hit.
[2025-05-30 22:39:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 22:39:25] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
[2025-05-30 22:39:25] [INFO ] Invariant cache hit.
[2025-05-30 22:39:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 22:39:26] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2025-05-30 22:39:26] [INFO ] Redundant transitions in 5 ms returned []
Running 414 sub problems to find dead transitions.
[2025-05-30 22:39:26] [INFO ] Flow matrix only has 198 transitions (discarded 252 similar events)
[2025-05-30 22:39:26] [INFO ] Invariant cache hit.
[2025-05-30 22:39:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 164 constraints, problems are : Problem set: 0 solved, 414 unsolved in 10925 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 198/330 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 414/578 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 578 constraints, problems are : Problem set: 0 solved, 414 unsolved in 18621 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
After SMT, in 29967ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 29972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30305 ms. Remains : 132/132 places, 450/450 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 92 edges and 132 vertex of which 42 / 132 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 85 transition count 128
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 63 transition count 128
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 63 transition count 118
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 53 transition count 118
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 48 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 48 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 43 transition count 83
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 43 transition count 83
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 43 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 42 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 42 transition count 65
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 115 place count 42 transition count 59
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 127 place count 36 transition count 59
Applied a total of 127 rules in 13 ms. Remains 36 /132 variables (removed 96) and now considering 59/450 (removed 391) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 36 cols
[2025-05-30 22:39:56] [INFO ] Computed 13 invariants in 1 ms
[2025-05-30 22:39:56] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 9 ms returned sat
[2025-05-30 22:39:56] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 22:39:56] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 1 ms returned sat
[2025-05-30 22:39:56] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 22:39:56] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 22:39:56] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 128 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 149833 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CloudDeployment-PT-6a
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 221
TRANSITIONS: 908
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 5517
NUPN UNITS: 27
LOADING TIME: 0.46
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.043
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.76
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 611
MODEL NAME: /home/mcc/execution/model
221 places, 908 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiLiveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1748644806862
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -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="CloudDeployment-PT-6a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is CloudDeployment-PT-6a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-tall-174854041500042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6a.tgz
mv CloudDeployment-PT-6a execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;