About the Execution of LTSMin+red for QuasiCertifProtocol-PT-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2827.312 | 197180.00 | 255937.00 | 638.80 | ??F?????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-171662337800106.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-32, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800106
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 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 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K 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 942K 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-32-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717221714228
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-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:01:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:01:55] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-06-01 06:01:55] [INFO ] Transformed 3806 places.
[2024-06-01 06:01:55] [INFO ] Transformed 506 transitions.
[2024-06-01 06:01:55] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Support contains 3703 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 53 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-06-01 06:01:55] [INFO ] Computed 3232 invariants in 112 ms
[2024-06-01 06:01:57] [INFO ] Implicit Places using invariants in 1492 ms returned []
[2024-06-01 06:01:57] [INFO ] Invariant cache hit.
[2024-06-01 06:01:59] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 3837 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-06-01 06:01:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3735 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 506/4241 variables, 3735/6967 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4241/4242 variables, and 7439 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30213 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3735/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61346ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61368ms
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65280 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3703 out of 3736 places after structural reductions.
[2024-06-01 06:03:01] [INFO ] Flatten gal took : 328 ms
[2024-06-01 06:03:02] [INFO ] Flatten gal took : 186 ms
[2024-06-01 06:03:02] [INFO ] Input system was already deterministic with 506 transitions.
Reduction of identical properties reduced properties to check from 63 to 58
RANDOM walk for 40000 steps (1071 resets) in 3358 ms. (11 steps per ms) remains 41/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 177 ms. (22 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 476 ms. (8 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 129 ms. (30 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 212 ms. (18 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 156 ms. (25 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
[2024-06-01 06:03:04] [INFO ] Invariant cache hit.
Problem AtomicPropp6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3638 variables, 3168/3168 constraints. Problems are: Problem set: 1 solved, 40 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3638/4242 variables, and 3168 constraints, problems are : Problem set: 1 solved, 40 unsolved in 5063 ms.
Refiners :[Generalized P Invariants (flows): 3168/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3638 variables, 3168/3168 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3638 variables, 0/3168 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 65/3703 variables, 64/3232 constraints. Problems are: Problem set: 1 solved, 40 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3703/4242 variables, and 3232 constraints, problems are : Problem set: 1 solved, 40 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 0/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 11513ms problems are : Problem set: 1 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3638 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 51 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 3736/3736 places, 506/506 transitions.
RANDOM walk for 40000 steps (1072 resets) in 1641 ms. (24 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 215 ms. (18 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
Interrupted probabilistic random walk after 468889 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 40
Probabilistic random walk after 468889 steps, saw 59026 distinct states, run finished after 3005 ms. (steps per millisecond=156 ) properties seen :0
[2024-06-01 06:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3638 variables, 3168/3168 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3638 variables, 0/3168 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 65/3703 variables, 64/3232 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3703 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 4 (OVERLAPS) 506/4209 variables, 3703/6935 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4209 variables, 0/6935 constraints. Problems are: Problem set: 3 solved, 37 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 6 (OVERLAPS) 33/4242 variables, 33/6968 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4242/4242 variables, and 6968 constraints, problems are : Problem set: 4 solved, 36 unsolved in 45020 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3638 variables, 3168/3168 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3638 variables, 0/3168 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 65/3703 variables, 64/3232 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3703 variables, 0/3232 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 506/4209 variables, 3703/6935 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4209/4242 variables, and 6971 constraints, problems are : Problem set: 4 solved, 36 unsolved in 45660 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3703/3736 constraints, PredecessorRefiner: 36/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 91826ms problems are : Problem set: 4 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3638 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 31 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 3736/3736 places, 506/506 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-01 06:04:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:04:52] [INFO ] Flatten gal took : 117 ms
FORMULA QuasiCertifProtocol-PT-32-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:04:52] [INFO ] Flatten gal took : 123 ms
[2024-06-01 06:04:53] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 3641 out of 3736 places (down from 3703) after GAL structural reductions.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 148 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:04:53] [INFO ] Flatten gal took : 81 ms
[2024-06-01 06:04:53] [INFO ] Flatten gal took : 99 ms
[2024-06-01 06:04:53] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 253 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:04:54] [INFO ] Flatten gal took : 79 ms
[2024-06-01 06:04:54] [INFO ] Flatten gal took : 79 ms
[2024-06-01 06:04:54] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 146 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:04:54] [INFO ] Flatten gal took : 81 ms
[2024-06-01 06:04:54] [INFO ] Flatten gal took : 87 ms
[2024-06-01 06:04:54] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 2616 are kept as prefixes of interest. Removing 1120 places using SCC suffix rule.35 ms
Discarding 1120 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2615 transition count 444
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2581 transition count 376
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2581 transition count 376
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 2581 transition count 376
Applied a total of 100 rules in 558 ms. Remains 2581 /3736 variables (removed 1155) and now considering 376/506 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 558 ms. Remains : 2581/3736 places, 376/506 transitions.
[2024-06-01 06:04:55] [INFO ] Flatten gal took : 54 ms
[2024-06-01 06:04:55] [INFO ] Flatten gal took : 56 ms
[2024-06-01 06:04:55] [INFO ] Input system was already deterministic with 376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 122 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:04:55] [INFO ] Flatten gal took : 77 ms
[2024-06-01 06:04:55] [INFO ] Flatten gal took : 83 ms
[2024-06-01 06:04:56] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3636 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.14 ms
Discarding 100 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
Applied a total of 3 rules in 462 ms. Remains 3634 /3736 variables (removed 102) and now considering 501/506 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 462 ms. Remains : 3634/3736 places, 501/506 transitions.
[2024-06-01 06:04:56] [INFO ] Flatten gal took : 76 ms
[2024-06-01 06:04:56] [INFO ] Flatten gal took : 79 ms
[2024-06-01 06:04:56] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 75 ms. Remains 3702 /3736 variables (removed 34) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 3702/3736 places, 504/506 transitions.
[2024-06-01 06:04:56] [INFO ] Flatten gal took : 77 ms
[2024-06-01 06:04:57] [INFO ] Flatten gal took : 94 ms
[2024-06-01 06:04:57] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3636 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.10 ms
Discarding 100 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
Applied a total of 3 rules in 510 ms. Remains 3634 /3736 variables (removed 102) and now considering 501/506 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 510 ms. Remains : 3634/3736 places, 501/506 transitions.
[2024-06-01 06:04:57] [INFO ] Flatten gal took : 69 ms
[2024-06-01 06:04:57] [INFO ] Flatten gal took : 71 ms
[2024-06-01 06:04:58] [INFO ] Input system was already deterministic with 501 transitions.
RANDOM walk for 40000 steps (983 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1167091 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :0 out of 1
Probabilistic random walk after 1167091 steps, saw 141603 distinct states, run finished after 3001 ms. (steps per millisecond=388 ) properties seen :0
// Phase 1: matrix 501 rows 3634 cols
[2024-06-01 06:05:01] [INFO ] Computed 3136 invariants in 51 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/81 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2131/2212 variables, 2080/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2212 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/2312 variables, 2212/4324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2312 variables, 0/4324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 458/2770 variables, 131/4455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2770 variables, 0/4455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1222/3992 variables, 1155/5610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3992 variables, 960/6570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3992 variables, 0/6570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/4129 variables, 133/6703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4129 variables, 64/6767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4129 variables, 0/6767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/4135 variables, 3/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4135 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4135 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4135/4135 variables, and 6770 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2163 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3634/3634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/81 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2131/2212 variables, 2080/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2212 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/2312 variables, 2212/4324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2312 variables, 0/4324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 458/2770 variables, 131/4455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2770 variables, 1/4456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2770 variables, 0/4456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1222/3992 variables, 1155/5611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3992 variables, 960/6571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3992 variables, 0/6571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/4129 variables, 133/6704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4129 variables, 64/6768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4129 variables, 0/6768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/4135 variables, 3/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4135 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4135 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4135/4135 variables, and 6771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2422 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3634/3634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4664ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 170 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
FORMULA QuasiCertifProtocol-PT-32-CTLFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 223 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:05:06] [INFO ] Flatten gal took : 73 ms
[2024-06-01 06:05:06] [INFO ] Flatten gal took : 76 ms
[2024-06-01 06:05:06] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 234 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:05:06] [INFO ] Flatten gal took : 72 ms
[2024-06-01 06:05:06] [INFO ] Flatten gal took : 75 ms
[2024-06-01 06:05:06] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 223 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:05:07] [INFO ] Flatten gal took : 73 ms
[2024-06-01 06:05:07] [INFO ] Flatten gal took : 76 ms
[2024-06-01 06:05:07] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 288 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 289 ms. Remains : 3701/3736 places, 503/506 transitions.
[2024-06-01 06:05:07] [INFO ] Flatten gal took : 72 ms
[2024-06-01 06:05:07] [INFO ] Flatten gal took : 108 ms
[2024-06-01 06:05:07] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3636 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.9 ms
Discarding 100 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
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 4 place count 3634 transition count 501
Applied a total of 4 rules in 761 ms. Remains 3634 /3736 variables (removed 102) and now considering 501/506 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 761 ms. Remains : 3634/3736 places, 501/506 transitions.
[2024-06-01 06:05:08] [INFO ] Flatten gal took : 72 ms
[2024-06-01 06:05:08] [INFO ] Flatten gal took : 75 ms
[2024-06-01 06:05:08] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.9 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 254 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 254 ms. Remains : 3701/3736 places, 503/506 transitions.
[2024-06-01 06:05:09] [INFO ] Flatten gal took : 73 ms
[2024-06-01 06:05:09] [INFO ] Flatten gal took : 90 ms
[2024-06-01 06:05:09] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 231 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 3736/3736 places, 506/506 transitions.
[2024-06-01 06:05:09] [INFO ] Flatten gal took : 74 ms
[2024-06-01 06:05:09] [INFO ] Flatten gal took : 75 ms
[2024-06-01 06:05:10] [INFO ] Input system was already deterministic with 506 transitions.
[2024-06-01 06:05:10] [INFO ] Flatten gal took : 114 ms
[2024-06-01 06:05:10] [INFO ] Flatten gal took : 112 ms
[2024-06-01 06:05:10] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 26 ms.
[2024-06-01 06:05:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 9 ms.
Total runtime 195579 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-32-CTLFireability-2024-00
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-01
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-03
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-04
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-05
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-06
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-07
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-09
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-10
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-11
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-12
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-13
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-14
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLFireability-2024-15
BK_STOP 1717221911408
--------------------
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-32-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/559/ctl_0_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/559/ctl_1_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/559/ctl_2_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/559/ctl_3_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/559/ctl_4_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/559/ctl_5_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/559/ctl_6_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/559/ctl_7_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/559/ctl_8_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/559/ctl_9_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/559/ctl_10_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/559/ctl_11_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/559/ctl_12_
ctl formula name QuasiCertifProtocol-PT-32-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/559/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-32"
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-32, 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-171662337800106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 ;