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.r514-smll-171654416600052.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 ltsminxred
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 r514-smll-171654416600052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:43 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 1717242820794

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:53:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 11:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:53:44] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2024-06-01 11:53:44] [INFO ] Transformed 529 places.
[2024-06-01 11:53:44] [INFO ] Transformed 785 transitions.
[2024-06-01 11:53:44] [INFO ] Found NUPN structural information;
[2024-06-01 11:53:44] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 618 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 3 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 3 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 214 ms. Remains 473 /529 variables (removed 56) and now considering 401/785 (removed 384) transitions.
// Phase 1: matrix 401 rows 473 cols
[2024-06-01 11:53:44] [INFO ] Computed 124 invariants in 50 ms
[2024-06-01 11:53:46] [INFO ] Implicit Places using invariants in 1563 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 1635 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 3 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 32 ms. Remains 397 /433 variables (removed 36) and now considering 365/401 (removed 36) transitions.
// Phase 1: matrix 365 rows 397 cols
[2024-06-01 11:53:46] [INFO ] Computed 84 invariants in 8 ms
[2024-06-01 11:53:46] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-06-01 11:53:46] [INFO ] Invariant cache hit.
[2024-06-01 11:53:47] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-06-01 11:53:48] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2422 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 4358 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 (369 resets) in 4233 ms. (9 steps per ms) remains 64/236 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
[2024-06-01 11:53:50] [INFO ] Invariant cache hit.
[2024-06-01 11:53:50] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 236/363 variables, 67/194 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 236/430 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 34/397 variables, 17/447 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 34/481 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 365/762 variables, 397/878 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 156/1034 constraints. Problems are: Problem set: 0 solved, 64 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, 64 unsolved in 5027 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: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 236/363 variables, 67/194 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 236/430 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 34/397 variables, 17/447 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 34/481 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 365/762 variables, 397/878 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 156/1034 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 64/1098 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 1098 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5015 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: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 10187ms problems are : Problem set: 0 solved, 64 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 127 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 53 times.
Iterating global reduction 0 with 53 rules applied. Total rules applied 53 place count 397 transition count 312
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 106 place count 344 transition count 312
Applied a total of 106 rules in 137 ms. Remains 344 /397 variables (removed 53) and now considering 312/365 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 344/397 places, 312/365 transitions.
RANDOM walk for 4000000 steps (35446 resets) in 46604 ms. (85 steps per ms) remains 41/64 properties
BEST_FIRST walk for 400004 steps (124 resets) in 788 ms. (506 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (122 resets) in 778 ms. (513 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (122 resets) in 804 ms. (496 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (123 resets) in 771 ms. (518 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (124 resets) in 770 ms. (518 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (121 resets) in 775 ms. (515 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (123 resets) in 778 ms. (513 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (121 resets) in 785 ms. (508 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (124 resets) in 838 ms. (476 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (124 resets) in 814 ms. (490 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (123 resets) in 881 ms. (453 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (124 resets) in 920 ms. (434 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (123 resets) in 785 ms. (508 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (121 resets) in 791 ms. (505 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (123 resets) in 784 ms. (509 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (123 resets) in 793 ms. (503 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (122 resets) in 789 ms. (506 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (123 resets) in 789 ms. (506 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (122 resets) in 781 ms. (511 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (124 resets) in 786 ms. (508 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (123 resets) in 766 ms. (521 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (124 resets) in 775 ms. (515 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (124 resets) in 767 ms. (520 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400004 steps (124 resets) in 767 ms. (520 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (123 resets) in 763 ms. (523 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (122 resets) in 757 ms. (527 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 762 ms. (524 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (125 resets) in 758 ms. (527 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 759 ms. (526 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 764 ms. (522 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (122 resets) in 768 ms. (520 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 761 ms. (524 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (122 resets) in 759 ms. (526 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (122 resets) in 778 ms. (513 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (124 resets) in 770 ms. (518 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 775 ms. (515 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 763 ms. (523 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 773 ms. (516 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 769 ms. (519 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (124 resets) in 774 ms. (516 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (123 resets) in 769 ms. (519 steps per ms) remains 39/39 properties
// Phase 1: matrix 312 rows 344 cols
[2024-06-01 11:54:21] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 11:54:21] [INFO ] State equation strengthened by 185 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 201/279 variables, 43/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 201/322 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 65/344 variables, 41/363 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 65/428 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 312/656 variables, 344/772 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 185/957 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/656 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/656 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 656/656 variables, and 957 constraints, problems are : Problem set: 0 solved, 39 unsolved in 5592 ms.
Refiners :[Domain max(s): 344/344 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 344/344 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 201/279 variables, 43/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 201/322 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 65/344 variables, 41/363 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 65/428 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 312/656 variables, 344/772 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 185/957 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/656 variables, 39/996 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/656 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/656 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 656/656 variables, and 996 constraints, problems are : Problem set: 0 solved, 39 unsolved in 7548 ms.
Refiners :[Domain max(s): 344/344 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 344/344 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 13185ms problems are : Problem set: 0 solved, 39 unsolved
Parikh walk visited 30 properties in 12726 ms.
Support contains 18 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 312/312 transitions.
Free-agglomeration rule applied 54 times.
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 344 transition count 258
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 108 place count 290 transition count 258
Applied a total of 108 rules in 53 ms. Remains 290 /344 variables (removed 54) and now considering 258/312 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 290/344 places, 258/312 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19789 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 7515 ms. (532 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7576 ms. (527 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7444 ms. (537 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7511 ms. (532 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 8224 ms. (486 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7732 ms. (517 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7626 ms. (524 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7577 ms. (527 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7562 ms. (528 steps per ms) remains 8/8 properties
// Phase 1: matrix 258 rows 290 cols
[2024-06-01 11:55:11] [INFO ] Computed 84 invariants in 6 ms
[2024-06-01 11:55:11] [INFO ] State equation strengthened by 239 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 51/67 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 223/290 variables, 75/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 223/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 258/548 variables, 290/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 239/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/548 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 903 constraints, problems are : Problem set: 0 solved, 8 unsolved in 598 ms.
Refiners :[Domain max(s): 290/290 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 290/290 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 51/67 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 223/290 variables, 75/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 223/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 258/548 variables, 290/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 239/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 8/911 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 8 unsolved in 878 ms.
Refiners :[Domain max(s): 290/290 constraints, Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 290/290 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1502ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=25 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 14 ms.
Able to resolve query QuasiLiveness after proving 237 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 89392 ms.
ITS solved all properties within timeout

BK_STOP 1717242912915

--------------------
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="ltsminxred"
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 ltsminxred"
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 r514-smll-171654416600052"
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.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 ;