Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r100-tall-171624200200072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is CloudReconfiguration-PT-301, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200200072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 11 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 19:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 19:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 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 1716363893103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-301
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:44:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 07:44:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:44:54] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-22 07:44:54] [INFO ] Transformed 2584 places.
[2024-05-22 07:44:54] [INFO ] Transformed 3094 transitions.
[2024-05-22 07:44:54] [INFO ] Found NUPN structural information;
[2024-05-22 07:44:54] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 258 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2957 edges and 2584 vertex of which 882 / 2584 are part of one of the 63 SCC in 12 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 1765 transition count 968
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 575 transition count 867
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 542 transition count 864
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 542 transition count 844
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 2558 place count 522 transition count 844
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 230 transition count 477
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 230 transition count 474
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 206 transition count 522
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 206 transition count 507
Applied a total of 3208 rules in 152 ms. Remains 206 /2584 variables (removed 2378) and now considering 507/3094 (removed 2587) transitions.
[2024-05-22 07:44:54] [INFO ] Flow matrix only has 428 transitions (discarded 79 similar events)
// Phase 1: matrix 428 rows 206 cols
[2024-05-22 07:44:54] [INFO ] Computed 4 invariants in 21 ms
[2024-05-22 07:44:55] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-22 07:44:55] [INFO ] Flow matrix only has 428 transitions (discarded 79 similar events)
[2024-05-22 07:44:55] [INFO ] Invariant cache hit.
[2024-05-22 07:44:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 07:44:55] [INFO ] Implicit Places using invariants and state equation in 307 ms returned [82, 141, 200]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 635 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 203/2584 places, 507/3094 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 200 transition count 504
Applied a total of 6 rules in 9 ms. Remains 200 /203 variables (removed 3) and now considering 504/507 (removed 3) transitions.
[2024-05-22 07:44:55] [INFO ] Flow matrix only has 425 transitions (discarded 79 similar events)
// Phase 1: matrix 425 rows 200 cols
[2024-05-22 07:44:55] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 07:44:55] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 07:44:55] [INFO ] Flow matrix only has 425 transitions (discarded 79 similar events)
[2024-05-22 07:44:55] [INFO ] Invariant cache hit.
[2024-05-22 07:44:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 07:44:55] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 200/2584 places, 504/3094 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1170 ms. Remains : 200/2584 places, 504/3094 transitions.
Discarding 310 transitions out of 504. Remains 194
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4870 resets) in 1557 ms. (25 steps per ms) remains 29/193 properties
BEST_FIRST walk for 4002 steps (53 resets) in 11 ms. (333 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (50 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (52 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (48 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (54 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (73 resets) in 41 ms. (95 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (49 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (52 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (54 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (50 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (48 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (47 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (51 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (46 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (47 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
[2024-05-22 07:44:56] [INFO ] Flow matrix only has 425 transitions (discarded 79 similar events)
[2024-05-22 07:44:56] [INFO ] Invariant cache hit.
[2024-05-22 07:44:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 22/54 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 331/385 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 234/619 variables, 141/250 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 141/391 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 7/398 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/619 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 5/624 variables, 5/403 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/624 variables, 5/408 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/624 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 1/625 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/625 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 409 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2241 ms.
Refiners :[Domain max(s): 200/200 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 22/54 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 331/385 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 234/619 variables, 141/250 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 141/391 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 7/398 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/619 variables, 27/425 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 5/624 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/624 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/624 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 1/625 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/625 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/625 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 436 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3561 ms.
Refiners :[Domain max(s): 200/200 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 5942ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 25 properties in 10299 ms.
Support contains 7 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 504/504 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 200 transition count 438
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 140 place count 126 transition count 355
Iterating global reduction 1 with 74 rules applied. Total rules applied 214 place count 126 transition count 355
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 277 place count 126 transition count 292
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 285 place count 118 transition count 282
Iterating global reduction 2 with 8 rules applied. Total rules applied 293 place count 118 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 299 place count 118 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 301 place count 116 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 116 transition count 270
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 305 place count 114 transition count 260
Iterating global reduction 3 with 2 rules applied. Total rules applied 307 place count 114 transition count 260
Performed 27 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 361 place count 87 transition count 227
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 373 place count 87 transition count 215
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
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 407 place count 70 transition count 231
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 433 place count 70 transition count 205
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 447 place count 56 transition count 165
Iterating global reduction 5 with 14 rules applied. Total rules applied 461 place count 56 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 466 place count 56 transition count 160
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 472 place count 50 transition count 148
Iterating global reduction 6 with 6 rules applied. Total rules applied 478 place count 50 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 484 place count 50 transition count 142
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 490 place count 50 transition count 136
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 491 place count 50 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 492 place count 49 transition count 135
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 493 place count 49 transition count 134
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 494 place count 49 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 495 place count 48 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 496 place count 48 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 497 place count 47 transition count 132
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 498 place count 47 transition count 131
Applied a total of 498 rules in 71 ms. Remains 47 /200 variables (removed 153) and now considering 131/504 (removed 373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 47/200 places, 131/504 transitions.
RANDOM walk for 2200398 steps (336616 resets) in 6560 ms. (335 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 194 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 21360 ms.
ITS solved all properties within timeout

BK_STOP 1716363915682

--------------------
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-301"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudReconfiguration-PT-301, 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 r100-tall-171624200200072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-301.tgz
mv CloudReconfiguration-PT-301 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;