About the Execution of GreatSPN+red for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13689.268 | 935985.00 | 3267148.00 | 563.50 | ?FFF??FTT?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.r311-tall-171662335800066.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 QuasiCertifProtocol-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 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 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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 78K 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-06-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716655020109
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:37:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 16:37:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:37:01] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-25 16:37:01] [INFO ] Transformed 270 places.
[2024-05-25 16:37:01] [INFO ] Transformed 116 transitions.
[2024-05-25 16:37:01] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 252 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 19 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 16:37:01] [INFO ] Computed 138 invariants in 22 ms
[2024-05-25 16:37:01] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-25 16:37:01] [INFO ] Invariant cache hit.
[2024-05-25 16:37:02] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 16:37:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/368 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4656 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 108/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/368 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 498 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6683 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11444ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11465ms
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12005 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 252 out of 252 places after structural reductions.
[2024-05-25 16:37:13] [INFO ] Flatten gal took : 45 ms
[2024-05-25 16:37:13] [INFO ] Flatten gal took : 41 ms
[2024-05-25 16:37:13] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3931 resets) in 3507 ms. (11 steps per ms) remains 47/63 properties
BEST_FIRST walk for 4003 steps (41 resets) in 113 ms. (35 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (43 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (41 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (68 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (71 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (70 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (67 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (67 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (44 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (66 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (71 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (42 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (70 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (64 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (68 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (41 resets) in 51 ms. (77 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (43 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (73 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (70 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (36 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (42 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (68 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (72 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (66 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (69 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (69 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (72 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (42 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (73 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (65 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (67 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (71 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (71 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (41 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
[2024-05-25 16:37:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (OVERLAPS) 115/365 variables, 250/388 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/388 constraints. Problems are: Problem set: 7 solved, 40 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/368 variables, 2/390 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 10 solved, 37 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 10 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 10 solved, 37 unsolved in 3166 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 126/126 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/126 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 6/222 variables, 6/132 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/132 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 106/328 variables, 222/354 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 36/390 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/390 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 25/353 variables, 16/406 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/407 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/407 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 2/355 variables, 1/408 constraints. Problems are: Problem set: 10 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/410 constraints. Problems are: Problem set: 10 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/368 variables, and 410 constraints, problems are : Problem set: 10 solved, 37 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 133/138 constraints, State Equation: 240/252 constraints, PredecessorRefiner: 37/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 8265ms problems are : Problem set: 10 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 216 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 116/116 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 252 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 251 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 250 transition count 112
Applied a total of 5 rules in 23 ms. Remains 250 /252 variables (removed 2) and now considering 112/116 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 250/252 places, 112/116 transitions.
RANDOM walk for 40000 steps (4506 resets) in 782 ms. (51 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (46 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (55 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (46 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (41 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (52 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (53 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (43 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (54 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 514717 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :17 out of 34
Probabilistic random walk after 514717 steps, saw 89617 distinct states, run finished after 3006 ms. (steps per millisecond=171 ) properties seen :17
// Phase 1: matrix 112 rows 250 cols
[2024-05-25 16:37:27] [INFO ] Computed 139 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 103/302 variables, 199/325 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 45/347 variables, 36/361 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 15/362 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 7/389 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 389 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1396 ms.
Refiners :[Generalized P Invariants (flows): 139/139 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 103/302 variables, 199/325 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 15/340 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 45/347 variables, 36/376 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 15/362 variables, 15/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 7/406 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/362 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 406 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3171 ms.
Refiners :[Generalized P Invariants (flows): 139/139 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 4610ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 15 different solutions.
Finished Parikh walk after 46 steps, including 0 resets, run visited all 17 properties in 5 ms. (steps per millisecond=9 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 12 ms.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:37:31] [INFO ] Flatten gal took : 15 ms
[2024-05-25 16:37:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:37:31] [INFO ] Flatten gal took : 14 ms
[2024-05-25 16:37:31] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 235 out of 252 places (down from 241) after GAL structural reductions.
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:31] [INFO ] Flatten gal took : 11 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 10 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 15 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 244 transition count 114
Applied a total of 3 rules in 19 ms. Remains 244 /252 variables (removed 8) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 244/252 places, 114/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 8 ms. Remains 244 /252 variables (removed 8) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 244/252 places, 114/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 252/252 places, 116/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 244 transition count 114
Applied a total of 2 rules in 13 ms. Remains 244 /252 variables (removed 8) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 244/252 places, 114/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 8 ms. Remains 244 /252 variables (removed 8) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 244/252 places, 114/116 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:37:32] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:37:32] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:37:32] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-05-25 16:37:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 116 transitions and 590 arcs took 2 ms.
Total runtime 31275 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running QuasiCertifProtocol-PT-06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 252
TRANSITIONS: 116
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 566
MODEL NAME: /home/mcc/execution/411/model
252 places, 116 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-13 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716655956094
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is QuasiCertifProtocol-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335800066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;