About the Execution of LTSMin+red for QuasiCertifProtocol-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 310.432 | 8091.00 | 20604.00 | 67.50 | T?F?TFTF??FT???? | 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.r520-tall-171662337700057.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700057
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.0K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 58K 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
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717219657106
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:27:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:27:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:27:38] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 05:27:38] [INFO ] Transformed 86 places.
[2024-06-01 05:27:38] [INFO ] Transformed 56 transitions.
[2024-06-01 05:27:38] [INFO ] Found NUPN structural information;
[2024-06-01 05:27:38] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 85 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Applied a total of 0 rules in 13 ms. Remains 86 /86 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 86 cols
[2024-06-01 05:27:38] [INFO ] Computed 31 invariants in 14 ms
[2024-06-01 05:27:38] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 05:27:38] [INFO ] Invariant cache hit.
[2024-06-01 05:27:38] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 05:27:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 05:27:39] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 7 ms to minimize.
[2024-06-01 05:27:39] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 3/86 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 05:27:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 56/142 variables, 86/120 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 120 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 3/86 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 05:27:41] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-06-01 05:27:41] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-06-01 05:27:41] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:27:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 05:27:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:27:41] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-06-01 05:27:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 56/142 variables, 86/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 52/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 179 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2096 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 10/10 constraints]
After SMT, in 3783ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3798ms
Finished structural reductions in LTL mode , in 1 iterations and 4099 ms. Remains : 86/86 places, 56/56 transitions.
Support contains 85 out of 86 places after structural reductions.
[2024-06-01 05:27:42] [INFO ] Flatten gal took : 26 ms
[2024-06-01 05:27:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:27:42] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:27:42] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6563 resets) in 2202 ms. (18 steps per ms) remains 67/88 properties
BEST_FIRST walk for 4000 steps (264 resets) in 40 ms. (97 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (222 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (222 resets) in 44 ms. (88 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (219 resets) in 71 ms. (55 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (225 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (229 resets) in 52 ms. (75 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (222 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (102 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (227 resets) in 63 ms. (62 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (95 resets) in 23 ms. (166 steps per ms) remains 34/67 properties
BEST_FIRST walk for 4003 steps (229 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (226 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (215 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (222 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (173 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (228 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (209 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (202 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (221 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (224 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (264 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (173 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (225 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (202 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (221 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (221 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (214 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (94 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (159 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (222 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (225 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (213 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (220 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (226 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (220 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (225 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
[2024-06-01 05:27:44] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp55 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 18/19 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/83 variables, 2/21 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 12 solved, 22 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/86 variables, 10/31 constraints. Problems are: Problem set: 15 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 15 solved, 19 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 7 (OVERLAPS) 56/142 variables, 86/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 117 constraints, problems are : Problem set: 31 solved, 3 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 28/33 variables, 3/3 constraints. Problems are: Problem set: 31 solved, 3 unsolved
[2024-06-01 05:27:44] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:27:44] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/5 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/54 variables, 11/16 constraints. Problems are: Problem set: 31 solved, 3 unsolved
[2024-06-01 05:27:44] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/17 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 14/68 variables, 11/28 constraints. Problems are: Problem set: 31 solved, 3 unsolved
[2024-06-01 05:27:44] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 56/124 variables, 68/97 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/99 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/99 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 18/142 variables, 18/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/142 variables, 6/123 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/142 variables, 1/124 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/142 variables, 0/124 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/142 variables, 0/124 constraints. Problems are: Problem set: 31 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 124 constraints, problems are : Problem set: 31 solved, 3 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 3/34 constraints, Known Traps: 4/4 constraints]
After SMT, in 574ms problems are : Problem set: 31 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 10 ms.
Successfully simplified 31 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:27:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 8 ms
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 6 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 55 out of 86 places (down from 69) after GAL structural reductions.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 23 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 22 transition count 19
Applied a total of 15 rules in 16 ms. Remains 22 /86 variables (removed 64) and now considering 19/56 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 22/86 places, 19/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 2 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/86 places, 56/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 6 ms. Remains 76 /86 variables (removed 10) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 76/86 places, 55/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 73 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 72 /86 variables (removed 14) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 72/86 places, 53/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 55
Applied a total of 2 rules in 9 ms. Remains 76 /86 variables (removed 10) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 76/86 places, 55/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 77 transition count 56
Applied a total of 9 rules in 2 ms. Remains 77 /86 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 77/86 places, 56/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 56
Applied a total of 8 rules in 1 ms. Remains 78 /86 variables (removed 8) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/86 places, 56/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 77 transition count 56
Applied a total of 9 rules in 2 ms. Remains 77 /86 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 77/86 places, 56/56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Input system was already deterministic with 56 transitions.
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:27:44] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:27:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 56 transitions and 223 arcs took 1 ms.
Total runtime 6545 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-01
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-09
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-12
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-13
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-14
Could not compute solution for formula : QuasiCertifProtocol-PT-02-CTLCardinality-2024-15
BK_STOP 1717219665197
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/546/ctl_0_
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/546/ctl_1_
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/546/ctl_2_
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/546/ctl_3_
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/546/ctl_4_
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/546/ctl_5_
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/546/ctl_6_
ctl formula name QuasiCertifProtocol-PT-02-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/546/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337700057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;