About the Execution of LTSMin+red for QuasiCertifProtocol-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 528.348 | 71198.00 | 99015.00 | 184.70 | ????F??F????T??T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337800074.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 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 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K 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 149K 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-10-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717219881051
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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:31:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:31:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:31:22] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-01 05:31:22] [INFO ] Transformed 550 places.
[2024-06-01 05:31:22] [INFO ] Transformed 176 transitions.
[2024-06-01 05:31:22] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 524 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 22 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-06-01 05:31:22] [INFO ] Computed 350 invariants in 47 ms
[2024-06-01 05:31:22] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 05:31:22] [INFO ] Invariant cache hit.
[2024-06-01 05:31:23] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 05:31:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/700 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/700 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 874 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12746 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 164/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/700 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/700 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 1038 constraints, problems are : Problem set: 0 solved, 164 unsolved in 22180 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 35140ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 35158ms
Starting structural reductions in LTL mode, iteration 1 : 524/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35850 ms. Remains : 524/550 places, 176/176 transitions.
Support contains 524 out of 524 places after structural reductions.
[2024-06-01 05:31:58] [INFO ] Flatten gal took : 72 ms
[2024-06-01 05:31:58] [INFO ] Flatten gal took : 60 ms
[2024-06-01 05:31:58] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 73 to 67
RANDOM walk for 40000 steps (2767 resets) in 2304 ms. (17 steps per ms) remains 56/67 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (22 resets) in 107 ms. (37 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (31 resets) in 62 ms. (63 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (30 resets) in 43 ms. (91 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (29 resets) in 134 ms. (29 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (32 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (30 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (23 resets) in 152 ms. (26 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (32 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (19 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (23 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (35 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (22 resets) in 94 ms. (42 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (35 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (31 resets) in 40 ms. (97 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (31 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (32 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 53 ms. (74 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (23 resets) in 40 ms. (97 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (21 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (29 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (32 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (22 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
[2024-06-01 05:32:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 11/514 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 4 (OVERLAPS) 176/690 variables, 514/864 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/864 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 10/700 variables, 10/874 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/700 variables, 0/874 constraints. Problems are: Problem set: 6 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 700/700 variables, and 874 constraints, problems are : Problem set: 6 solved, 49 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 340/340 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 174/664 variables, 490/830 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/664 variables, 41/871 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/871 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 35/699 variables, 33/904 constraints. Problems are: Problem set: 6 solved, 49 unsolved
SMT process timed out in 10203ms, After SMT, problems are : Problem set: 6 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 490 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 176/176 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 524 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 523 transition count 174
Applied a total of 2 rules in 38 ms. Remains 523 /524 variables (removed 1) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 523/524 places, 174/176 transitions.
RANDOM walk for 40000 steps (2894 resets) in 1018 ms. (39 steps per ms) remains 44/49 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (23 resets) in 42 ms. (93 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (19 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (22 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
// Phase 1: matrix 174 rows 523 cols
[2024-06-01 05:32:11] [INFO ] Computed 351 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/490 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 174/664 variables, 490/830 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 33/697 variables, 33/863 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 11/874 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/697 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/697 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 874 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 523/523 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/490 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 174/664 variables, 490/830 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 39/869 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 33/697 variables, 33/902 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/697 variables, 11/913 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/697 variables, 5/918 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/697 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/697 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 697/697 variables, and 918 constraints, problems are : Problem set: 0 solved, 44 unsolved in 14101 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 523/523 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 19205ms problems are : Problem set: 0 solved, 44 unsolved
Fused 44 Parikh solutions to 42 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=41 )
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 )
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 2 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 44 properties in 26 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:32:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 30 ms
FORMULA QuasiCertifProtocol-PT-10-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 37 ms
[2024-06-01 05:32:30] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
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.
FORMULA QuasiCertifProtocol-PT-10-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 27 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 18 ms
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 18 ms
[2024-06-01 05:32:30] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 18 ms
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:32:30] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:30] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 512 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 27 ms. Remains 512 /524 variables (removed 12) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 512/524 places, 174/176 transitions.
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:30] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:30] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 524/524 places, 176/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 357 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.3 ms
Discarding 167 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 356 transition count 128
Applied a total of 23 rules in 23 ms. Remains 356 /524 variables (removed 168) and now considering 128/176 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 356/524 places, 128/176 transitions.
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:32:31] [INFO ] Input system was already deterministic with 128 transitions.
RANDOM walk for 40000 steps (2469 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (191 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 901 steps, run visited all 1 properties in 9 ms. (steps per millisecond=100 )
Probabilistic random walk after 901 steps, saw 856 distinct states, run finished after 12 ms. (steps per millisecond=75 ) properties seen :1
FORMULA QuasiCertifProtocol-PT-10-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:32:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:32:31] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2024-06-01 05:32:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 524 places, 176 transitions and 1182 arcs took 4 ms.
Total runtime 69678 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-10-CTLFireability-2024-00
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-01
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-02
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-03
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-05
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-06
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-09
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-10
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-11
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-13
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLFireability-2024-14
BK_STOP 1717219952249
--------------------
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
mcc2024
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/534/ctl_0_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/534/ctl_1_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/534/ctl_2_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/534/ctl_3_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/534/ctl_4_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/534/ctl_5_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/534/ctl_6_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/534/ctl_7_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/534/ctl_8_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/534/ctl_9_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/534/ctl_10_
ctl formula name QuasiCertifProtocol-PT-10-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/534/ctl_11_
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-10"
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-10, 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-171662337800074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 ;