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.r154-tall-174876825400267.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 Parking-PT-432, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825400267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 192K 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 1748842712156

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-432
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:38:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 05:38:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:38:33] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-06-02 05:38:33] [INFO ] Transformed 529 places.
[2025-06-02 05:38:33] [INFO ] Transformed 785 transitions.
[2025-06-02 05:38:33] [INFO ] Found NUPN structural information;
[2025-06-02 05:38:33] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 199 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 529/529 places, 785/785 transitions.
Ensure Unique test removed 328 transitions
Reduce isomorphic transitions removed 328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 529 transition count 441
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 360 place count 513 transition count 441
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 360 place count 513 transition count 425
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 392 place count 497 transition count 425
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 440 place count 473 transition count 401
Applied a total of 440 rules in 75 ms. Remains 473 /529 variables (removed 56) and now considering 401/785 (removed 384) transitions.
// Phase 1: matrix 401 rows 473 cols
[2025-06-02 05:38:33] [INFO ] Computed 124 invariants in 30 ms
[2025-06-02 05:38:34] [INFO ] Implicit Places using invariants in 550 ms returned [63, 70, 76, 82, 89, 96, 102, 108, 132, 134, 175, 182, 188, 194, 201, 208, 214, 220, 244, 246, 287, 294, 300, 306, 313, 320, 326, 332, 356, 358, 399, 406, 412, 418, 425, 432, 438, 444, 468, 470]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 577 ms to find 40 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 433/529 places, 401/785 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 397 transition count 365
Applied a total of 72 rules in 12 ms. Remains 397 /433 variables (removed 36) and now considering 365/401 (removed 36) transitions.
// Phase 1: matrix 365 rows 397 cols
[2025-06-02 05:38:34] [INFO ] Computed 84 invariants in 5 ms
[2025-06-02 05:38:34] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-02 05:38:34] [INFO ] Invariant cache hit.
[2025-06-02 05:38:34] [INFO ] State equation strengthened by 156 read => feed constraints.
[2025-06-02 05:38:35] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 397/529 places, 365/785 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1679 ms. Remains : 397/529 places, 365/785 transitions.
Discarding 128 transitions out of 365. Remains 237
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (367 resets) in 2207 ms. (18 steps per ms) remains 62/236 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
[2025-06-02 05:38:36] [INFO ] Invariant cache hit.
[2025-06-02 05:38:36] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 235/357 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 235/421 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 40/397 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 40/481 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 365/762 variables, 397/878 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 156/1034 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 1034 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5009 ms.
Refiners :[Domain max(s): 397/397 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 235/357 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 235/421 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 40/397 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 40/481 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 365/762 variables, 397/878 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 156/1034 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 62/1096 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 1096 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5008 ms.
Refiners :[Domain max(s): 397/397 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 10069ms problems are : Problem set: 0 solved, 62 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 122 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 365/365 transitions.
Free-agglomeration rule applied 56 times.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 397 transition count 309
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 112 place count 341 transition count 309
Applied a total of 112 rules in 53 ms. Remains 341 /397 variables (removed 56) and now considering 309/365 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 341/397 places, 309/365 transitions.
RANDOM walk for 4000000 steps (35296 resets) in 29724 ms. (134 steps per ms) remains 40/62 properties
BEST_FIRST walk for 400004 steps (133 resets) in 574 ms. (695 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 574 ms. (695 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (133 resets) in 574 ms. (695 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (133 resets) in 579 ms. (689 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 571 ms. (699 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 583 ms. (684 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 572 ms. (698 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 570 ms. (700 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 579 ms. (689 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 579 ms. (689 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 577 ms. (692 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (131 resets) in 572 ms. (698 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 585 ms. (682 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 584 ms. (683 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (129 resets) in 577 ms. (692 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (130 resets) in 577 ms. (692 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 573 ms. (696 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 574 ms. (695 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (133 resets) in 584 ms. (683 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 576 ms. (693 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (131 resets) in 574 ms. (695 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 577 ms. (692 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 572 ms. (698 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 582 ms. (686 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 574 ms. (695 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (130 resets) in 581 ms. (687 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 577 ms. (692 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 571 ms. (699 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (130 resets) in 580 ms. (688 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 573 ms. (696 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (130 resets) in 583 ms. (684 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 572 ms. (698 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (132 resets) in 582 ms. (686 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 575 ms. (694 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 577 ms. (692 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 576 ms. (693 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (130 resets) in 574 ms. (695 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (132 resets) in 579 ms. (689 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (131 resets) in 576 ms. (693 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (133 resets) in 580 ms. (688 steps per ms) remains 40/40 properties
// Phase 1: matrix 309 rows 341 cols
[2025-06-02 05:39:00] [INFO ] Computed 84 invariants in 2 ms
[2025-06-02 05:39:00] [INFO ] State equation strengthened by 188 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 201/281 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 201/325 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 60/341 variables, 40/365 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 309/650 variables, 341/766 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 188/954 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/650 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 954 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2800 ms.
Refiners :[Domain max(s): 341/341 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 341/341 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 201/281 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 201/325 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 60/341 variables, 40/365 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 309/650 variables, 341/766 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 188/954 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 40/994 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/650 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 994 constraints, problems are : Problem set: 0 solved, 40 unsolved in 3850 ms.
Refiners :[Domain max(s): 341/341 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 341/341 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 6683ms problems are : Problem set: 0 solved, 40 unsolved
Parikh walk visited 17 properties in 1552 ms.
Support contains 46 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 309/309 transitions.
Free-agglomeration rule applied 37 times.
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 341 transition count 272
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 74 place count 304 transition count 272
Applied a total of 74 rules in 35 ms. Remains 304 /341 variables (removed 37) and now considering 272/309 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 304/341 places, 272/309 transitions.
RANDOM walk for 4000000 steps (17020 resets) in 21845 ms. (183 steps per ms) remains 17/23 properties
BEST_FIRST walk for 400003 steps (185 resets) in 634 ms. (629 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (188 resets) in 630 ms. (633 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (186 resets) in 627 ms. (636 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (188 resets) in 628 ms. (635 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (189 resets) in 625 ms. (638 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (190 resets) in 628 ms. (635 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (187 resets) in 625 ms. (638 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (193 resets) in 627 ms. (636 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (193 resets) in 627 ms. (636 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (188 resets) in 630 ms. (633 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (180 resets) in 626 ms. (637 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (186 resets) in 622 ms. (642 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (189 resets) in 629 ms. (634 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (188 resets) in 631 ms. (632 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (175 resets) in 620 ms. (644 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400004 steps (180 resets) in 628 ms. (635 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (190 resets) in 624 ms. (640 steps per ms) remains 16/16 properties
// Phase 1: matrix 272 rows 304 cols
[2025-06-02 05:39:17] [INFO ] Computed 84 invariants in 1 ms
[2025-06-02 05:39:17] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 101/133 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 101/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 171/304 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 171/388 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 272/576 variables, 304/692 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 225/917 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 917 constraints, problems are : Problem set: 0 solved, 16 unsolved in 818 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 304/304 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 101/133 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 101/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 171/304 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 171/388 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 272/576 variables, 304/692 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 225/917 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 16/933 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/576 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 576/576 variables, and 933 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1164 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 304/304 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 1996ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 15 properties in 883 ms.
Support contains 2 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 272/272 transitions.
Free-agglomeration rule applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 304 transition count 250
Reduce places removed 22 places and 0 transitions.
Graph (complete) has 583 edges and 282 vertex of which 146 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 116 output transitions
Drop transitions (Output transitions of discarded places.) removed 116 transitions
Iterating post reduction 0 with 23 rules applied. Total rules applied 45 place count 146 transition count 134
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 53 place count 146 transition count 126
Applied a total of 53 rules in 25 ms. Remains 146 /304 variables (removed 158) and now considering 126/272 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 146/304 places, 126/272 transitions.
RANDOM walk for 674 steps (0 resets) in 6 ms. (96 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 237 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 46996 ms.
ITS solved all properties within timeout

BK_STOP 1748842760403

--------------------
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="Parking-PT-432"
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 Parking-PT-432, 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 r154-tall-174876825400267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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