About the Execution of LTSMin+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 |
| 431.556 | 33214.00 | 53674.00 | 169.70 | ???F??????F????? | 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-171662337700066.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700066
=====================================================================
--------------------
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 1717219750165
Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:29:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:29:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:29:11] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-01 05:29:11] [INFO ] Transformed 270 places.
[2024-06-01 05:29:11] [INFO ] Transformed 116 transitions.
[2024-06-01 05:29:11] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 190 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-06-01 05:29:11] [INFO ] Computed 138 invariants in 25 ms
[2024-06-01 05:29:11] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 05:29:11] [INFO ] Invariant cache hit.
[2024-06-01 05:29:12] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 05:29:12] [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 4588 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 6547 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 11244ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11260ms
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11744 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 252 out of 252 places after structural reductions.
[2024-06-01 05:29:23] [INFO ] Flatten gal took : 49 ms
[2024-06-01 05:29:23] [INFO ] Flatten gal took : 23 ms
[2024-06-01 05:29:23] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3934 resets) in 2317 ms. (17 steps per ms) remains 51/63 properties
BEST_FIRST walk for 4004 steps (40 resets) in 100 ms. (39 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (41 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (43 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (41 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (72 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (71 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (74 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (64 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (71 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (69 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (72 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (72 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (28 resets) in 36 ms. (108 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (70 resets) in 27 ms. (143 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (73 resets) in 33 ms. (117 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (64 resets) in 36 ms. (108 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (42 resets) in 43 ms. (90 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (69 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (43 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (68 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (41 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (67 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (41 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (42 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (72 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (67 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (66 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (68 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (70 resets) in 27 ms. (143 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (65 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (43 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (68 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (71 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (70 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (64 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (70 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (69 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
[2024-06-01 05:29:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 9 solved, 41 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/389 constraints. Problems are: Problem set: 9 solved, 41 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/368 variables, 1/390 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 10 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 10 solved, 40 unsolved in 2716 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 126/126 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/126 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 6/223 variables, 6/132 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/132 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 108/331 variables, 223/355 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 39/394 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/394 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 30/361 variables, 22/416 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 1/417 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/417 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 6/367 variables, 6/423 constraints. Problems are: Problem set: 10 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 6/429 constraints. Problems are: Problem set: 10 solved, 40 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 1)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 0)
(s64 0)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 0)
(s99 1)
(s100 1)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/368 variables, and 429 constraints, problems are : Problem set: 10 solved, 40 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 251/252 constraints, PredecessorRefiner: 40/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 7829ms problems are : Problem set: 10 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 217 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 252 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 251 transition count 114
Applied a total of 2 rules in 26 ms. Remains 251 /252 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 251/252 places, 114/116 transitions.
RANDOM walk for 40000 steps (4521 resets) in 634 ms. (62 steps per ms) remains 36/40 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (42 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (43 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (55 resets) in 27 ms. (142 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 4004 steps (52 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (42 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (54 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (41 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 28 ms. (138 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 (42 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (54 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
// Phase 1: matrix 114 rows 251 cols
[2024-06-01 05:29:33] [INFO ] Computed 139 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 7/221 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 105/326 variables, 221/353 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 24/350 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 15/365 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 390 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2300 ms.
Refiners :[Generalized P Invariants (flows): 139/139 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 7/221 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 105/326 variables, 221/353 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 34/387 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 24/350 variables, 15/402 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 15/365 variables, 15/417 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 7/424 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/365 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 424 constraints, problems are : Problem set: 0 solved, 34 unsolved in 6254 ms.
Refiners :[Generalized P Invariants (flows): 139/139 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 8613ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 28 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 34 properties in 4 ms. (steps per millisecond=10 )
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 )
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 34 properties in 30 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-06-01 05:29:42] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:29:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 15 ms
[2024-06-01 05:29:42] [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 9 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 9 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 25 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:29:42] [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 22 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 22 ms. Remains : 252/252 places, 116/116 transitions.
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:29:42] [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 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 32 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 32 ms. Remains : 244/252 places, 114/116 transitions.
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:42] [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 17 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 17 ms. Remains : 244/252 places, 114/116 transitions.
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:42] [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 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-06-01 05:29:42] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 19 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:42] [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.1 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 14 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 14 ms. Remains : 244/252 places, 114/116 transitions.
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 5 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 05:29:42] [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-06-01 05:29:42] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 05:29:42] [INFO ] Input system was already deterministic with 114 transitions.
[2024-06-01 05:29:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:43] [INFO ] Flatten gal took : 22 ms
[2024-06-01 05:29:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 05:29:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 116 transitions and 590 arcs took 1 ms.
Total runtime 31744 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-06-CTLFireability-2024-00
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-01
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-02
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-04
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-05
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-06
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-07
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-09
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-11
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-12
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-13
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-14
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLFireability-2024-15
BK_STOP 1717219783379
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/525/ctl_0_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/525/ctl_1_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/525/ctl_2_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/525/ctl_3_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/525/ctl_4_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/525/ctl_5_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/525/ctl_6_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/525/ctl_7_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/525/ctl_8_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/525/ctl_9_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/525/ctl_10_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/525/ctl_11_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/525/ctl_12_
ctl formula name QuasiCertifProtocol-PT-06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/525/ctl_13_
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-06"
export BK_EXAMINATION="CTLFireability"
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-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 r520-tall-171662337700066"
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 ;