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.r012-smll-171620123700022.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 ASLink-PT-02b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620123700022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 53K 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.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 417K 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 1716242820878

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:07:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-20 22:07:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:07:03] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-05-20 22:07:03] [INFO ] Transformed 1242 places.
[2024-05-20 22:07:03] [INFO ] Transformed 1621 transitions.
[2024-05-20 22:07:03] [INFO ] Found NUPN structural information;
[2024-05-20 22:07:03] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 536 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 1242 transition count 1339
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 296 rules applied. Total rules applied 578 place count 960 transition count 1325
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 582 place count 956 transition count 1325
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 582 place count 956 transition count 1041
Deduced a syphon composed of 284 places in 27 ms
Ensure Unique test removed 23 places
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 591 rules applied. Total rules applied 1173 place count 649 transition count 1041
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 with 18 rules applied. Total rules applied 1191 place count 647 transition count 1025
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1207 place count 631 transition count 1025
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1207 place count 631 transition count 1017
Deduced a syphon composed of 8 places in 8 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1231 place count 615 transition count 1017
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1231 place count 615 transition count 1009
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1247 place count 607 transition count 1009
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 5 with 237 rules applied. Total rules applied 1484 place count 488 transition count 891
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1488 place count 486 transition count 903
Applied a total of 1488 rules in 480 ms. Remains 486 /1242 variables (removed 756) and now considering 903/1621 (removed 718) transitions.
// Phase 1: matrix 903 rows 486 cols
[2024-05-20 22:07:04] [INFO ] Computed 87 invariants in 109 ms
[2024-05-20 22:07:05] [INFO ] Implicit Places using invariants in 1534 ms returned [1, 19, 20, 21, 25, 55, 73, 155, 169, 170, 171, 172, 192, 210, 292, 297, 308, 309, 310, 311, 312, 347, 349, 353, 371, 372, 373, 374, 387, 393, 399, 405, 411, 417, 423, 429, 435, 441, 447, 485]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1603 ms to find 40 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 446/1242 places, 903/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 446 transition count 850
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 with 55 rules applied. Total rules applied 108 place count 393 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 392 transition count 848
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 109 place count 392 transition count 826
Deduced a syphon composed of 22 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 154 place count 369 transition count 826
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 161 place count 366 transition count 822
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 362 transition count 822
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 165 place count 362 transition count 821
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 361 transition count 821
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 241 place count 324 transition count 784
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 246 place count 324 transition count 779
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 323 transition count 779
Applied a total of 248 rules in 89 ms. Remains 323 /446 variables (removed 123) and now considering 779/903 (removed 124) transitions.
// Phase 1: matrix 779 rows 323 cols
[2024-05-20 22:07:06] [INFO ] Computed 43 invariants in 28 ms
[2024-05-20 22:07:06] [INFO ] Implicit Places using invariants in 628 ms returned [98, 104, 109, 110, 197, 203, 208, 209, 214, 308, 311, 314, 317, 320]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 633 ms to find 14 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 309/1242 places, 779/1621 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 296 transition count 766
Applied a total of 26 rules in 12 ms. Remains 296 /309 variables (removed 13) and now considering 766/779 (removed 13) transitions.
// Phase 1: matrix 766 rows 296 cols
[2024-05-20 22:07:06] [INFO ] Computed 29 invariants in 12 ms
[2024-05-20 22:07:07] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-20 22:07:07] [INFO ] Invariant cache hit.
[2024-05-20 22:07:08] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 296/1242 places, 766/1621 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 4993 ms. Remains : 296/1242 places, 766/1621 transitions.
Discarding 44 transitions out of 766. Remains 722
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (864 resets) in 4890 ms. (8 steps per ms) remains 483/721 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 483/483 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 483/483 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 483/483 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 483/483 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 483/483 properties
[2024-05-20 22:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s80 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s90 1.0)
(s105 1.0)
(s107 1.0)
(s108 1.0)
(s113 1.0)
(s114 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/1062 variables, and 161 constraints, problems are : Problem set: 0 solved, 483 unsolved in 5054 ms.
Refiners :[Domain max(s): 159/296 constraints, Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 2/16 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (OVERLAPS) 86/245 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 86/259 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-05-20 22:07:21] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 245/1062 variables, and 261 constraints, problems are : Problem set: 0 solved, 483 unsolved in 5023 ms.
Refiners :[Domain max(s): 245/296 constraints, Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 3/16 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 0/483 constraints, Known Traps: 1/1 constraints]
After SMT, in 10918ms problems are : Problem set: 0 solved, 483 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 159 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 766/766 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 280 transition count 750
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 280 transition count 750
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 280 transition count 748
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 34 place count 280 transition count 747
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 279 transition count 747
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 277 transition count 744
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 277 transition count 744
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 277 transition count 734
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 267 transition count 734
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 267 transition count 733
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 266 transition count 733
Applied a total of 62 rules in 194 ms. Remains 266 /296 variables (removed 30) and now considering 733/766 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 266/296 places, 733/766 transitions.
RANDOM walk for 3721821 steps (87406 resets) in 120004 ms. (31 steps per ms) remains 478/483 properties
BEST_FIRST walk for 40002 steps (342 resets) in 655 ms. (60 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (351 resets) in 711 ms. (56 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (360 resets) in 802 ms. (49 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (370 resets) in 499 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (351 resets) in 522 ms. (76 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (396 resets) in 609 ms. (65 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (356 resets) in 739 ms. (54 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (355 resets) in 683 ms. (58 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (351 resets) in 522 ms. (76 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (374 resets) in 493 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (359 resets) in 526 ms. (75 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (369 resets) in 498 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (366 resets) in 513 ms. (77 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (371 resets) in 504 ms. (79 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (372 resets) in 484 ms. (82 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (360 resets) in 510 ms. (78 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40001 steps (372 resets) in 513 ms. (77 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (341 resets) in 525 ms. (76 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (343 resets) in 519 ms. (76 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (375 resets) in 503 ms. (79 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (362 resets) in 504 ms. (79 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (373 resets) in 490 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (374 resets) in 498 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (360 resets) in 499 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (356 resets) in 495 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (371 resets) in 497 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40000 steps (328 resets) in 512 ms. (77 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (360 resets) in 488 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40001 steps (358 resets) in 497 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (342 resets) in 500 ms. (79 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (351 resets) in 499 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40001 steps (353 resets) in 505 ms. (79 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (359 resets) in 498 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (348 resets) in 514 ms. (77 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (374 resets) in 498 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40001 steps (372 resets) in 492 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (363 resets) in 495 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (370 resets) in 489 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40001 steps (337 resets) in 508 ms. (78 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40001 steps (347 resets) in 495 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (358 resets) in 498 ms. (80 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (366 resets) in 490 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (364 resets) in 490 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40002 steps (381 resets) in 487 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (359 resets) in 503 ms. (79 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (373 resets) in 489 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (360 resets) in 490 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (361 resets) in 491 ms. (81 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40004 steps (360 resets) in 511 ms. (78 steps per ms) remains 478/478 properties
BEST_FIRST walk for 40003 steps (355 resets) in 497 ms. (80 steps per ms) remains 478/478 properties
Interrupted probabilistic random walk after 4925021 steps, run timeout after 111001 ms. (steps per millisecond=44 ) properties seen :5 out of 478
Probabilistic random walk after 4925021 steps, saw 1515714 distinct states, run finished after 111011 ms. (steps per millisecond=44 ) properties seen :5
// Phase 1: matrix 733 rows 266 cols
[2024-05-20 22:09:50] [INFO ] Computed 29 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 62/208 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-20 22:09:59] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 3 ms to minimize.
[2024-05-20 22:10:03] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
Problem qltransition_629 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 13129ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 146 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 733/733 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 731
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 730
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 730
Applied a total of 6 rules in 38 ms. Remains 263 /266 variables (removed 3) and now considering 730/733 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 263/266 places, 730/733 transitions.
Total runtime 180016 ms.
ITS solved all properties within timeout

BK_STOP 1716243003600

--------------------
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="ASLink-PT-02b"
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 ASLink-PT-02b, 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 r012-smll-171620123700022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b 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 ;