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.r579-smll-171734921100050.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 MedleyA-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 82K Jun 2 16:33 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 MedleyA-PT-07-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717353430944

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:37:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:37:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:37:13] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-06-02 18:37:13] [INFO ] Transformed 145 places.
[2024-06-02 18:37:13] [INFO ] Transformed 287 transitions.
[2024-06-02 18:37:13] [INFO ] Found NUPN structural information;
[2024-06-02 18:37:13] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Support contains 96 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 285
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 135 transition count 279
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 135 transition count 279
Applied a total of 14 rules in 42 ms. Remains 135 /143 variables (removed 8) and now considering 279/285 (removed 6) transitions.
// Phase 1: matrix 279 rows 135 cols
[2024-06-02 18:37:13] [INFO ] Computed 10 invariants in 27 ms
[2024-06-02 18:37:14] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-02 18:37:14] [INFO ] Invariant cache hit.
[2024-06-02 18:37:14] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-06-02 18:37:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 18:37:18] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 26 ms to minimize.
[2024-06-02 18:37:18] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:37:19] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:37:19] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-06-02 18:37:19] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:37:19] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-06-02 18:37:19] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:37:20] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:37:20] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:37:20] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/20 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 18:37:22] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:37:22] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:37:22] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:37:22] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 4/24 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 18:37:23] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:37:23] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:37:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:37:23] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:37:23] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 5/29 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/29 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 279/414 variables, 135/164 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 18:37:27] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 165 constraints, problems are : Problem set: 48 solved, 230 unsolved in 20337 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 48 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/30 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/30 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 279/414 variables, 135/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 230/395 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 18:37:42] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:37:43] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 3 ms to minimize.
[2024-06-02 18:37:43] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:37:43] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:37:43] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:37:43] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-06-02 18:37:44] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-02 18:37:45] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-02 18:37:45] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-06-02 18:37:45] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 10/405 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 18:37:51] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:37:52] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-06-02 18:37:52] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 3/408 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 18:37:58] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-06-02 18:37:58] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 2/410 constraints. Problems are: Problem set: 48 solved, 230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 410 constraints, problems are : Problem set: 48 solved, 230 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 230/278 constraints, Known Traps: 35/35 constraints]
After SMT, in 51209ms problems are : Problem set: 48 solved, 230 unsolved
Search for dead transitions found 48 dead transitions in 51286ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 231/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52075 ms. Remains : 135/143 places, 231/285 transitions.
Support contains 96 out of 135 places after structural reductions.
[2024-06-02 18:38:06] [INFO ] Flatten gal took : 109 ms
[2024-06-02 18:38:06] [INFO ] Flatten gal took : 47 ms
[2024-06-02 18:38:06] [INFO ] Input system was already deterministic with 231 transitions.
RANDOM walk for 40000 steps (1401 resets) in 2995 ms. (13 steps per ms) remains 64/100 properties
BEST_FIRST walk for 4004 steps (31 resets) in 49 ms. (80 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (28 resets) in 41 ms. (95 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (29 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (33 resets) in 73 ms. (54 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (31 resets) in 27 ms. (143 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (26 resets) in 44 ms. (88 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (30 resets) in 19 ms. (200 steps per ms) remains 60/64 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (35 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (32 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (34 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (31 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (34 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (34 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (29 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (33 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (32 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (31 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (32 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (29 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (32 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (30 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (35 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (33 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (30 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (29 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
// Phase 1: matrix 231 rows 135 cols
[2024-06-02 18:38:08] [INFO ] Computed 10 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/99 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 52 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp87 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/128 variables, 6/10 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 226/354 variables, 128/138 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/138 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 9/363 variables, 5/143 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/143 constraints. Problems are: Problem set: 13 solved, 47 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 9 (OVERLAPS) 3/366 variables, 2/145 constraints. Problems are: Problem set: 14 solved, 46 unsolved
[2024-06-02 18:38:10] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/146 constraints. Problems are: Problem set: 14 solved, 46 unsolved
[2024-06-02 18:38:11] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 1/147 constraints. Problems are: Problem set: 14 solved, 46 unsolved
[2024-06-02 18:38:11] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
Problem AtomicPropp14 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 1/148 constraints. Problems are: Problem set: 15 solved, 45 unsolved
[2024-06-02 18:38:12] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 1/149 constraints. Problems are: Problem set: 15 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 0/149 constraints. Problems are: Problem set: 15 solved, 45 unsolved
[2024-06-02 18:38:13] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 150 constraints, problems are : Problem set: 15 solved, 45 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 15 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 45 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/97 variables, 4/4 constraints. Problems are: Problem set: 17 solved, 43 unsolved
[2024-06-02 18:38:13] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 17 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 17 solved, 43 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 4 (OVERLAPS) 31/128 variables, 6/11 constraints. Problems are: Problem set: 20 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 5/16 constraints. Problems are: Problem set: 20 solved, 40 unsolved
[2024-06-02 18:38:14] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:38:14] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:38:14] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:38:14] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:38:14] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 6 ms to minimize.
[2024-06-02 18:38:14] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:38:15] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 7/23 constraints. Problems are: Problem set: 20 solved, 40 unsolved
[2024-06-02 18:38:15] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 3 ms to minimize.
[2024-06-02 18:38:15] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:38:15] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 3/26 constraints. Problems are: Problem set: 20 solved, 40 unsolved
[2024-06-02 18:38:15] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:38:16] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:38:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:38:16] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 4/30 constraints. Problems are: Problem set: 20 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/30 constraints. Problems are: Problem set: 20 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 226/354 variables, 128/158 constraints. Problems are: Problem set: 20 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 37/195 constraints. Problems are: Problem set: 20 solved, 40 unsolved
[2024-06-02 18:38:17] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:38:18] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:38:18] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-06-02 18:38:18] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 4 ms to minimize.
SMT process timed out in 10246ms, After SMT, problems are : Problem set: 20 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 231/231 transitions.
Graph (complete) has 410 edges and 135 vertex of which 130 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 130 transition count 217
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 17 place count 126 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 125 transition count 216
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 18 place count 125 transition count 210
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 119 transition count 210
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 46 place count 103 transition count 193
Iterating global reduction 3 with 16 rules applied. Total rules applied 62 place count 103 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 101 transition count 189
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 101 transition count 189
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 76 place count 96 transition count 184
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 92 place count 88 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 88 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 122 place count 88 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 88 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 87 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 124 place count 87 transition count 179
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 86 transition count 179
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 86 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 130 place count 84 transition count 177
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 132 place count 84 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 83 transition count 176
Applied a total of 133 rules in 140 ms. Remains 83 /135 variables (removed 52) and now considering 176/231 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 83/135 places, 176/231 transitions.
RANDOM walk for 40000 steps (3277 resets) in 957 ms. (41 steps per ms) remains 16/40 properties
BEST_FIRST walk for 4003 steps (63 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (63 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (63 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (68 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (63 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (68 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (60 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (63 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (67 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (66 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (63 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (64 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (61 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (61 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (59 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
// Phase 1: matrix 176 rows 83 cols
[2024-06-02 18:38:19] [INFO ] Computed 8 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 22/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 26/74 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 171/245 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 13/258 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/259 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/259 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 91 constraints, problems are : Problem set: 0 solved, 16 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 22/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 26/74 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 171/245 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 13/258 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:38:20] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:38:21] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 1/259 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/259 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 109 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
After SMT, in 2986ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 15 properties in 13292 ms.
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 83 transition count 164
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 75 transition count 164
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 75 transition count 160
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 71 transition count 160
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 64 transition count 153
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 64 transition count 153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 63 place count 53 transition count 143
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 77 place count 46 transition count 181
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 85 place count 46 transition count 173
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 46 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 44 transition count 171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 44 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 43 transition count 170
Applied a total of 91 rules in 44 ms. Remains 43 /83 variables (removed 40) and now considering 170/176 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 43/83 places, 170/176 transitions.
RANDOM walk for 40000 steps (4289 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (891 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42114 steps, run visited all 1 properties in 114 ms. (steps per millisecond=369 )
Probabilistic random walk after 42114 steps, saw 11549 distinct states, run finished after 121 ms. (steps per millisecond=348 ) properties seen :1
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:38:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:38:35] [INFO ] Flatten gal took : 20 ms
FORMULA MedleyA-PT-07-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:38:35] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:38:35] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 64 out of 135 places (down from 71) after GAL structural reductions.
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 410 edges and 135 vertex of which 130 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Graph (complete) has 410 edges and 135 vertex of which 132 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 131 transition count 205
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 109 transition count 201
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 107 transition count 199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 54 place count 107 transition count 195
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 62 place count 103 transition count 195
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 88 place count 77 transition count 162
Iterating global reduction 3 with 26 rules applied. Total rules applied 114 place count 77 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 114 place count 77 transition count 160
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 75 transition count 160
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 142 place count 62 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 61 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 61 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 60 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 153 place count 60 transition count 139
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 60 transition count 136
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 159 place count 57 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 159 place count 57 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 163 place count 55 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 167 place count 53 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 52 transition count 131
Applied a total of 168 rules in 73 ms. Remains 52 /135 variables (removed 83) and now considering 131/231 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 52/135 places, 131/231 transitions.
[2024-06-02 18:38:35] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:38:35] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:38:35] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 107 transition count 199
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 105 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 105 transition count 195
Applied a total of 60 rules in 17 ms. Remains 105 /135 variables (removed 30) and now considering 195/231 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 105/135 places, 195/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 109 transition count 203
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 109 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 107 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 107 transition count 199
Applied a total of 56 rules in 11 ms. Remains 107 /135 variables (removed 28) and now considering 199/231 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 107/135 places, 199/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 106 transition count 198
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 106 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 104 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 104 transition count 194
Applied a total of 62 rules in 9 ms. Remains 104 /135 variables (removed 31) and now considering 194/231 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 104/135 places, 194/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 110 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 110 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 108 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 108 transition count 199
Applied a total of 54 rules in 5 ms. Remains 108 /135 variables (removed 27) and now considering 199/231 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 108/135 places, 199/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 108 transition count 200
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 108 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 106 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 106 transition count 196
Applied a total of 58 rules in 5 ms. Remains 106 /135 variables (removed 29) and now considering 196/231 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 106/135 places, 196/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 106 transition count 198
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 106 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 104 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 104 transition count 194
Applied a total of 62 rules in 5 ms. Remains 104 /135 variables (removed 31) and now considering 194/231 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 104/135 places, 194/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 109 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 109 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 107 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 107 transition count 197
Applied a total of 56 rules in 4 ms. Remains 107 /135 variables (removed 28) and now considering 197/231 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 107/135 places, 197/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Graph (complete) has 410 edges and 135 vertex of which 130 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 129 transition count 204
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 107 transition count 200
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 105 transition count 198
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 54 place count 105 transition count 196
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 103 transition count 196
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 84 place count 77 transition count 163
Iterating global reduction 3 with 26 rules applied. Total rules applied 110 place count 77 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 110 place count 77 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 75 transition count 161
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 138 place count 62 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 61 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 61 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 60 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 149 place count 60 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 152 place count 60 transition count 137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 57 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 155 place count 57 transition count 135
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 159 place count 55 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 163 place count 53 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 52 transition count 132
Applied a total of 164 rules in 38 ms. Remains 52 /135 variables (removed 83) and now considering 132/231 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 52/135 places, 132/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 132 transitions.
RANDOM walk for 605 steps (63 resets) in 8 ms. (67 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-07-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 111 transition count 204
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 111 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 110 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 110 transition count 202
Applied a total of 50 rules in 5 ms. Remains 110 /135 variables (removed 25) and now considering 202/231 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 110/135 places, 202/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 109 transition count 202
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 109 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 107 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 107 transition count 198
Applied a total of 56 rules in 4 ms. Remains 107 /135 variables (removed 28) and now considering 198/231 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 107/135 places, 198/231 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:38:36] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:38:36] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 18:38:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 231 transitions and 870 arcs took 4 ms.
Total runtime 83509 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-07-CTLFireability-2024-15

BK_STOP 1717353517145

--------------------
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 MedleyA-PT-07-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/707/ctl_0_
ctl formula name MedleyA-PT-07-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/707/ctl_1_
ctl formula name MedleyA-PT-07-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/707/ctl_2_
ctl formula name MedleyA-PT-07-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/707/ctl_3_
ctl formula name MedleyA-PT-07-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/707/ctl_4_
ctl formula name MedleyA-PT-07-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/707/ctl_5_
ctl formula name MedleyA-PT-07-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/707/ctl_6_
ctl formula name MedleyA-PT-07-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/707/ctl_7_
ctl formula name MedleyA-PT-07-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/707/ctl_8_
ctl formula name MedleyA-PT-07-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/707/ctl_9_
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="MedleyA-PT-07"
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 MedleyA-PT-07, 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 r579-smll-171734921100050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-07.tgz
mv MedleyA-PT-07 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;