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

About the Execution of GreatSPN+red for ShieldIIPt-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2241.252 189352.00 434763.00 367.70 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.r364-tall-171683777400212.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 ShieldIIPt-PT-100A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777400212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 13 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 539K 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 1716911953076

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 15:59:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 15:59:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:59:14] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-28 15:59:14] [INFO ] Transformed 1903 places.
[2024-05-28 15:59:14] [INFO ] Transformed 1403 transitions.
[2024-05-28 15:59:14] [INFO ] Found NUPN structural information;
[2024-05-28 15:59:14] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 328 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1903/1903 places, 1403/1403 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1901 transition count 1400
Applied a total of 5 rules in 148 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1403 (removed 3) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-28 15:59:14] [INFO ] Computed 901 invariants in 37 ms
[2024-05-28 15:59:16] [INFO ] Implicit Places using invariants in 1532 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1574 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1899/1903 places, 1400/1403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 74 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-28 15:59:16] [INFO ] Computed 899 invariants in 12 ms
[2024-05-28 15:59:17] [INFO ] Implicit Places using invariants in 1198 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1205 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 1897/1903 places, 1399/1403 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 62 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-28 15:59:17] [INFO ] Computed 898 invariants in 11 ms
[2024-05-28 15:59:18] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-05-28 15:59:18] [INFO ] Invariant cache hit.
[2024-05-28 15:59:21] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 3388 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 1896/1903 places, 1398/1403 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 6472 ms. Remains : 1896/1903 places, 1398/1403 transitions.
Discarding 399 transitions out of 1398. Remains 999
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 5591 ms. (7 steps per ms) remains 823/998 properties
BEST_FIRST walk for 122 steps (8 resets) in 26 ms. (4 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 39 ms. (3 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 36 ms. (3 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 28 ms. (4 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 18 ms. (6 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 15 ms. (7 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 13 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 22 ms. (5 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 14 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 15 ms. (7 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 23 ms. (5 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 15 ms. (7 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 15 ms. (7 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 16 ms. (7 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 823/823 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 823/823 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 23 ms. (5 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 823/823 properties
BEST_FIRST walk for 121 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 823/823 properties
[2024-05-28 15:59:22] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1571 variables, 1571/1571 constraints. Problems are: Problem set: 0 solved, 823 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1571/3294 variables, and 1571 constraints, problems are : Problem set: 0 solved, 823 unsolved in 5060 ms.
Refiners :[Domain max(s): 1571/1896 constraints, Positive P Invariants (semi-flows): 0/898 constraints, State Equation: 0/1896 constraints, PredecessorRefiner: 823/823 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 823 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1571 variables, 1571/1571 constraints. Problems are: Problem set: 0 solved, 823 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1571/3294 variables, and 1571 constraints, problems are : Problem set: 0 solved, 823 unsolved in 5030 ms.
Refiners :[Domain max(s): 1571/1896 constraints, Positive P Invariants (semi-flows): 0/898 constraints, State Equation: 0/1896 constraints, PredecessorRefiner: 0/823 constraints, Known Traps: 0/0 constraints]
After SMT, in 10821ms problems are : Problem set: 0 solved, 823 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1571 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 1896 transition count 1398
Applied a total of 32 rules in 106 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1896/1896 places, 1398/1398 transitions.
RANDOM walk for 1281557 steps (0 resets) in 120004 ms. (10 steps per ms) remains 699/823 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 125 ms. (31 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4002 steps (8 resets) in 136 ms. (29 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 98 ms. (40 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 125 ms. (31 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4002 steps (8 resets) in 90 ms. (43 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 699/699 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 699/699 properties
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-28 16:00:05] [INFO ] Computed 898 invariants in 8 ms
[2024-05-28 16:00:05] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1333 variables, 1333/1333 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1333 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (OVERLAPS) 19/1352 variables, 640/1973 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1352 variables, 19/1992 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1352/3294 variables, and 1992 constraints, problems are : Problem set: 0 solved, 699 unsolved in 45019 ms.
Refiners :[Domain max(s): 1352/1896 constraints, Positive P Invariants (semi-flows): 640/898 constraints, State Equation: 0/1896 constraints, ReadFeed: 0/18 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1333 variables, 1333/1333 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1333 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (OVERLAPS) 19/1352 variables, 640/1973 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1352 variables, 19/1992 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1352 variables, 0/1992 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (OVERLAPS) 544/1896 variables, 258/2250 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1896 variables, 544/2794 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 1)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 1)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 1)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 1)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 1)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 1)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 1)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 1)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 1)
(s352 1)
(s353 0)
(s354 1)
(s355 0)
(s356 1)
(s357 0)
(s358 1)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 1)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 1)
(s372 0)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 1)
(s383 1)
(s384 0)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 1)
(s391 0)
(s392 1)
(s393 0)
(s394 1)
(s395 0)
(s396 1)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 1)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 1)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 1)
(s421 1)
(s422 0)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 1)
(s428 1)
(s429 0)
(s430 1)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 1)
(s440 1)
(s441 timeout
0)
(s442 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1896/3294 variables, and 2794 constraints, problems are : Problem set: 0 solved, 699 unsolved in 45024 ms.
Refiners :[Domain max(s): 1896/1896 constraints, Positive P Invariants (semi-flows): 898/898 constraints, State Equation: 0/1896 constraints, ReadFeed: 0/18 constraints, PredecessorRefiner: 0/699 constraints, Known Traps: 0/0 constraints]
After SMT, in 90610ms problems are : Problem set: 0 solved, 699 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1333 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 1896 transition count 1398
Applied a total of 26 rules in 78 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1896/1896 places, 1398/1398 transitions.
RANDOM walk for 1428074 steps (4 resets) in 120004 ms. (11 steps per ms) remains 670/699 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 98 ms. (40 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 129 ms. (30 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 134 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 131 ms. (30 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 135 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4002 steps (8 resets) in 182 ms. (21 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 151 ms. (26 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 155 ms. (25 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 153 ms. (25 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4001 steps (8 resets) in 146 ms. (27 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4002 steps (8 resets) in 141 ms. (28 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 134 ms. (29 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 670/670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 135 ms. (29 steps per ms) remains 670/670 properties
Finished probabilistic random walk after 215013 steps, run visited all 670 properties in 14409 ms. (steps per millisecond=14 )
Probabilistic random walk after 215013 steps, saw 212774 distinct states, run finished after 14420 ms. (steps per millisecond=14 ) properties seen :670
Able to resolve query QuasiLiveness after proving 999 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 188173 ms.
ITS solved all properties within timeout

BK_STOP 1716912142428

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldIIPt-PT-100A"
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 ShieldIIPt-PT-100A, 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 r364-tall-171683777400212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A 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 ;