About the Execution of 2024-gold for CloudReconfiguration-PT-313
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15692.600 | 20500.00 | 45665.00 | 96.80 | 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-174854041800192.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 CloudReconfiguration-PT-313, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tall-174854041800192
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.9K 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.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 660K 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 1748648409108
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-313
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:40:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 23:40:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:40:10] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2025-05-30 23:40:10] [INFO ] Transformed 2585 places.
[2025-05-30 23:40:10] [INFO ] Transformed 3095 transitions.
[2025-05-30 23:40:10] [INFO ] Found NUPN structural information;
[2025-05-30 23:40:10] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 263 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2957 edges and 2585 vertex of which 882 / 2585 are part of one of the 63 SCC in 13 ms
Free SCC test removed 819 places
Ensure Unique test removed 936 transitions
Reduce isomorphic transitions removed 936 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1190 transitions
Trivial Post-agglo rules discarded 1190 transitions
Performed 1190 trivial Post agglomeration. Transition count delta: 1190
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1191 place count 1766 transition count 969
Reduce places removed 1190 places and 0 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 1291 rules applied. Total rules applied 2482 place count 576 transition count 868
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 2518 place count 543 transition count 865
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 2518 place count 543 transition count 845
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 2558 place count 523 transition count 845
Performed 292 Post agglomeration using F-continuation condition with reduction of 75 identical transitions.
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 3142 place count 231 transition count 478
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 3145 place count 231 transition count 475
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 3193 place count 207 transition count 523
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 3208 place count 207 transition count 508
Applied a total of 3208 rules in 156 ms. Remains 207 /2585 variables (removed 2378) and now considering 508/3095 (removed 2587) transitions.
[2025-05-30 23:40:10] [INFO ] Flow matrix only has 429 transitions (discarded 79 similar events)
// Phase 1: matrix 429 rows 207 cols
[2025-05-30 23:40:10] [INFO ] Computed 4 invariants in 22 ms
[2025-05-30 23:40:11] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-05-30 23:40:11] [INFO ] Flow matrix only has 429 transitions (discarded 79 similar events)
[2025-05-30 23:40:11] [INFO ] Invariant cache hit.
[2025-05-30 23:40:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 23:40:11] [INFO ] Implicit Places using invariants and state equation in 302 ms returned [82, 200]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 621 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 205/2585 places, 508/3095 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 203 transition count 506
Applied a total of 4 rules in 17 ms. Remains 203 /205 variables (removed 2) and now considering 506/508 (removed 2) transitions.
[2025-05-30 23:40:11] [INFO ] Flow matrix only has 427 transitions (discarded 79 similar events)
// Phase 1: matrix 427 rows 203 cols
[2025-05-30 23:40:11] [INFO ] Computed 2 invariants in 3 ms
[2025-05-30 23:40:11] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 23:40:11] [INFO ] Flow matrix only has 427 transitions (discarded 79 similar events)
[2025-05-30 23:40:11] [INFO ] Invariant cache hit.
[2025-05-30 23:40:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 23:40:11] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 203/2585 places, 506/3095 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1163 ms. Remains : 203/2585 places, 506/3095 transitions.
Discarding 310 transitions out of 506. Remains 196
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4570 resets) in 2291 ms. (17 steps per ms) remains 27/195 properties
BEST_FIRST walk for 4004 steps (65 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (65 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (59 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (70 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (67 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (66 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (74 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (66 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (68 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (62 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (86 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (46 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (49 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (47 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
[2025-05-30 23:40:12] [INFO ] Flow matrix only has 427 transitions (discarded 79 similar events)
[2025-05-30 23:40:12] [INFO ] Invariant cache hit.
[2025-05-30 23:40:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 75/104 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 75/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 362/466 variables, 104/210 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 159/625 variables, 95/307 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 95/402 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 5/407 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/625 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 4/629 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/629 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/629 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 1/630 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/630 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 0/630 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 416 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2215 ms.
Refiners :[Domain max(s): 203/203 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 75/104 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 75/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 362/466 variables, 104/210 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 159/625 variables, 95/311 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 95/406 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/625 variables, 5/411 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/625 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/625 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 4/629 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/629 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/629 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 1/630 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 0/630 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 440 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3262 ms.
Refiners :[Domain max(s): 203/203 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 5612ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 22 properties in 8733 ms.
Support contains 7 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 506/506 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 203 transition count 441
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 139 place count 129 transition count 358
Iterating global reduction 1 with 74 rules applied. Total rules applied 213 place count 129 transition count 358
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 276 place count 129 transition count 295
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 284 place count 121 transition count 285
Iterating global reduction 2 with 8 rules applied. Total rules applied 292 place count 121 transition count 285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 298 place count 121 transition count 279
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 300 place count 119 transition count 273
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 119 transition count 273
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 304 place count 117 transition count 263
Iterating global reduction 3 with 2 rules applied. Total rules applied 306 place count 117 transition count 263
Performed 27 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 360 place count 90 transition count 230
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 372 place count 90 transition count 218
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 406 place count 73 transition count 235
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 432 place count 73 transition count 209
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 446 place count 59 transition count 169
Iterating global reduction 5 with 14 rules applied. Total rules applied 460 place count 59 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 465 place count 59 transition count 164
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 471 place count 53 transition count 152
Iterating global reduction 6 with 6 rules applied. Total rules applied 477 place count 53 transition count 152
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 483 place count 53 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 489 place count 53 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 490 place count 53 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 491 place count 52 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 492 place count 52 transition count 138
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 493 place count 52 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 494 place count 51 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 495 place count 51 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 496 place count 50 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 497 place count 50 transition count 135
Applied a total of 497 rules in 79 ms. Remains 50 /203 variables (removed 153) and now considering 135/506 (removed 371) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 50/203 places, 135/506 transitions.
RANDOM walk for 3439170 steps (456757 resets) in 8116 ms. (423 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 196 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 19293 ms.
ITS solved all properties within timeout
BK_STOP 1748648429608
--------------------
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="CloudReconfiguration-PT-313"
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 CloudReconfiguration-PT-313, 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-174854041800192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-313.tgz
mv CloudReconfiguration-PT-313 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 ;