fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r188-tall-171640615800047
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1121.924 149828.00 267957.00 449.60 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r188-tall-171640615800047.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 FlexibleBarrier-PT-12b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640615800047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 536K 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 1716472413166

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 13:53:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 13:53:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:53:34] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-23 13:53:34] [INFO ] Transformed 1988 places.
[2024-05-23 13:53:34] [INFO ] Transformed 2289 transitions.
[2024-05-23 13:53:34] [INFO ] Found NUPN structural information;
[2024-05-23 13:53:34] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 274 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1950 edges and 1988 vertex of which 74 / 1988 are part of one of the 12 SCC in 13 ms
Free SCC test removed 62 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 502 place count 1926 transition count 1725
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1003 place count 1425 transition count 1725
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 1003 place count 1425 transition count 1593
Deduced a syphon composed of 132 places in 9 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 1267 place count 1293 transition count 1593
Performed 831 Post agglomeration using F-continuation condition.Transition count delta: 831
Deduced a syphon composed of 831 places in 1 ms
Reduce places removed 831 places and 0 transitions.
Iterating global reduction 2 with 1662 rules applied. Total rules applied 2929 place count 462 transition count 762
Applied a total of 2929 rules in 419 ms. Remains 462 /1988 variables (removed 1526) and now considering 762/2289 (removed 1527) transitions.
[2024-05-23 13:53:35] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
// Phase 1: matrix 727 rows 462 cols
[2024-05-23 13:53:35] [INFO ] Computed 14 invariants in 30 ms
[2024-05-23 13:53:35] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-23 13:53:35] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
[2024-05-23 13:53:35] [INFO ] Invariant cache hit.
[2024-05-23 13:53:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-23 13:53:36] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
Running 761 sub problems to find dead transitions.
[2024-05-23 13:53:36] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
[2024-05-23 13:53:36] [INFO ] Invariant cache hit.
[2024-05-23 13:53:36] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 461/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/462 variables, 14/475 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 5 (OVERLAPS) 726/1188 variables, 462/938 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1188 variables, 72/1010 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1188/1189 variables, and 1010 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30032 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 462/462 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 761 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 461/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/462 variables, 14/475 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 5 (OVERLAPS) 726/1188 variables, 462/938 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1188 variables, 72/1010 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1188 variables, 761/1771 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1189 variables, and 1771 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30021 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 462/462 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 0/0 constraints]
After SMT, in 61530ms problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 61560ms
Starting structural reductions in LIVENESS mode, iteration 1 : 462/1988 places, 762/2289 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63526 ms. Remains : 462/1988 places, 762/2289 transitions.
Discarding 435 transitions out of 762. Remains 327
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2278 resets) in 3813 ms. (10 steps per ms) remains 268/326 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 268/268 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 268/268 properties
[2024-05-23 13:54:39] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
[2024-05-23 13:54:39] [INFO ] Invariant cache hit.
[2024-05-23 13:54:39] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 60/462 variables, 14/416 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 60/476 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1189 variables, and 476 constraints, problems are : Problem set: 0 solved, 268 unsolved in 5012 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/462 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 60/462 variables, 14/416 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 60/476 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 726/1188 variables, 462/938 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1188 variables, 72/1010 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1188 variables, 268/1278 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1189 variables, and 1278 constraints, problems are : Problem set: 0 solved, 268 unsolved in 5016 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 462/462 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 10238ms problems are : Problem set: 0 solved, 268 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 402 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 762/762 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 462 transition count 726
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 462 transition count 704
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 80 place count 440 transition count 704
Applied a total of 80 rules in 109 ms. Remains 440 /462 variables (removed 22) and now considering 704/762 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 440/462 places, 704/762 transitions.
RANDOM walk for 4000000 steps (248581 resets) in 71130 ms. (56 steps per ms) remains 33/268 properties
BEST_FIRST walk for 400004 steps (8 resets) in 586 ms. (681 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 600 ms. (665 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 666 ms. (599 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (119 resets) in 256 ms. (1556 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (117 resets) in 216 ms. (1843 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (118 resets) in 189 ms. (2105 steps per ms) remains 27/30 properties
BEST_FIRST walk for 400004 steps (120 resets) in 168 ms. (2366 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (117 resets) in 162 ms. (2454 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (186 resets) in 220 ms. (1809 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (186 resets) in 199 ms. (2000 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (182 resets) in 194 ms. (2051 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (185 resets) in 208 ms. (1913 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (184 resets) in 195 ms. (2040 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (184 resets) in 185 ms. (2150 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (186 resets) in 195 ms. (2040 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (187 resets) in 191 ms. (2083 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (185 resets) in 195 ms. (2040 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (184 resets) in 188 ms. (2116 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (185 resets) in 219 ms. (1818 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (186 resets) in 194 ms. (2051 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (185 resets) in 201 ms. (1980 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (185 resets) in 203 ms. (1960 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (183 resets) in 191 ms. (2083 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (181 resets) in 187 ms. (2127 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (183 resets) in 213 ms. (1869 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (185 resets) in 193 ms. (2061 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (185 resets) in 192 ms. (2072 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (186 resets) in 207 ms. (1923 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (186 resets) in 200 ms. (1990 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (186 resets) in 194 ms. (2051 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (184 resets) in 196 ms. (2030 steps per ms) remains 27/27 properties
// Phase 1: matrix 704 rows 440 cols
[2024-05-23 13:55:10] [INFO ] Computed 14 invariants in 15 ms
[2024-05-23 13:55:10] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 411/440 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 411/454 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 704/1144 variables, 440/894 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 82/976 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/1144 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 976 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2040 ms.
Refiners :[Domain max(s): 440/440 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 440/440 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 411/440 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 411/454 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 704/1144 variables, 440/894 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 82/976 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 27/1003 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1144 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/1144 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1003 constraints, problems are : Problem set: 0 solved, 27 unsolved in 17403 ms.
Refiners :[Domain max(s): 440/440 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 440/440 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 19520ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 20 properties in 31960 ms.
Support contains 9 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 704/704 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 320 transition count 584
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 320 transition count 584
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 111 rules applied. Total rules applied 351 place count 320 transition count 473
Free-agglomeration rule applied 132 times with reduction of 5 identical transitions.
Iterating global reduction 1 with 132 rules applied. Total rules applied 483 place count 320 transition count 336
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 620 place count 188 transition count 331
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 675 place count 133 transition count 276
Iterating global reduction 2 with 55 rules applied. Total rules applied 730 place count 133 transition count 276
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 785 place count 133 transition count 221
Applied a total of 785 rules in 83 ms. Remains 133 /440 variables (removed 307) and now considering 221/704 (removed 483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 133/440 places, 221/704 transitions.
RANDOM walk for 107756 steps (1372 resets) in 1089 ms. (98 steps per ms) remains 0/7 properties
Able to resolve query QuasiLiveness after proving 327 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 148706 ms.
ITS solved all properties within timeout

BK_STOP 1716472562994

--------------------
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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r188-tall-171640615800047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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