About the Execution of LTSMin+red for ShieldIIPs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 890.531 | 115154.00 | 186869.00 | 229.80 | ?????????????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.r528-tall-171683760400130.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 ShieldIIPs-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400130
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K 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 ShieldIIPs-PT-040A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-040A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717228323150
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:52:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:52:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:52:04] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-06-01 07:52:04] [INFO ] Transformed 1003 places.
[2024-06-01 07:52:04] [INFO ] Transformed 963 transitions.
[2024-06-01 07:52:04] [INFO ] Found NUPN structural information;
[2024-06-01 07:52:04] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 190 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 76 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-06-01 07:52:04] [INFO ] Computed 361 invariants in 28 ms
[2024-06-01 07:52:05] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-06-01 07:52:05] [INFO ] Invariant cache hit.
[2024-06-01 07:52:06] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 07:52:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30041 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:52:51] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 8 ms to minimize.
[2024-06-01 07:52:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:52:52] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:52:52] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:52:52] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:52:52] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:52:53] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:52:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:52:53] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:52:53] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:52:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:52:54] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 4 ms to minimize.
[2024-06-01 07:52:54] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:52:54] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:52:54] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:52:59] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:52:59] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:52:59] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:53:00] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:53:00] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:53:00] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:53:01] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:53:01] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:53:01] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:53:03] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 4 ms to minimize.
[2024-06-01 07:53:03] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:53:04] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:53:04] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:53:04] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:53:05] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:53:05] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 4 ms to minimize.
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 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60671ms
Finished structural reductions in LTL mode , in 1 iterations and 62751 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 190 out of 1003 places after structural reductions.
[2024-06-01 07:53:07] [INFO ] Flatten gal took : 163 ms
[2024-06-01 07:53:07] [INFO ] Flatten gal took : 81 ms
[2024-06-01 07:53:08] [INFO ] Input system was already deterministic with 963 transitions.
Support contains 184 out of 1003 places (down from 190) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 2683 ms. (14 steps per ms) remains 6/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 6/6 properties
[2024-06-01 07:53:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 56/81 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 922/1003 variables, 337/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 922/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 963/1966 variables, 1003/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:53:10] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:53:10] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:53:11] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:53:11] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:53:11] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:53:11] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:53:11] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:53:11] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:53:12] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:53:12] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:53:12] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:53:12] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1966 variables, 12/2379 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1966 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 2379 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3362 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 56/81 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 922/1003 variables, 337/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 922/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 12/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 6/1382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 0/1382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 963/1966 variables, 1003/2385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 6/2391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1966 variables, 0/2391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1966 variables, 0/2391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 2391 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2743 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 18/18 constraints]
After SMT, in 6127ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 21378 ms.
Support contains 18 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 272 times.
Drop transitions (Partial Free agglomeration) removed 272 transitions
Iterating global reduction 0 with 272 rules applied. Total rules applied 276 place count 1001 transition count 961
Applied a total of 276 rules in 166 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1001/1003 places, 961/963 transitions.
RANDOM walk for 40000 steps (8 resets) in 1701 ms. (23 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
// Phase 1: matrix 961 rows 1001 cols
[2024-06-01 07:53:38] [INFO ] Computed 361 invariants in 39 ms
[2024-06-01 07:53:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 31/44 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 955/999 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 955/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/1001 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 2/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:53:38] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:53:39] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 4 ms to minimize.
[2024-06-01 07:53:39] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:53:39] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:53:39] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:53:40] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:53:40] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 4 ms to minimize.
[2024-06-01 07:53:40] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:53:40] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:53:40] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:53:41] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:53:41] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:53:41] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:53:41] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 14/2381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/1962 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2381 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3856 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 360/360 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 31/44 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 955/999 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 955/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 14/1373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:53:42] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:53:42] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:53:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 3/1376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1001 variables, 1/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 2/1379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1001 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 961/1962 variables, 1001/2380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 4/2384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 3/2387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1962 variables, 20/2407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:53:46] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:53:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1962 variables, 8/2415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1962 variables, 0/2415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1962 variables, 0/2415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2415 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4802 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 360/360 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 45/45 constraints]
After SMT, in 8721ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 7191 ms.
Support contains 5 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 101 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1001/1001 places, 961/961 transitions.
RANDOM walk for 40000 steps (8 resets) in 498 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36446 steps, run visited all 1 properties in 332 ms. (steps per millisecond=109 )
Probabilistic random walk after 36446 steps, saw 35101 distinct states, run finished after 336 ms. (steps per millisecond=108 ) properties seen :1
[2024-06-01 07:53:54] [INFO ] Flatten gal took : 57 ms
[2024-06-01 07:53:54] [INFO ] Flatten gal took : 55 ms
[2024-06-01 07:53:54] [INFO ] Input system was already deterministic with 963 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:54] [INFO ] Flatten gal took : 50 ms
[2024-06-01 07:53:54] [INFO ] Flatten gal took : 51 ms
[2024-06-01 07:53:55] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 46 ms
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 47 ms
[2024-06-01 07:53:55] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:53:55] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 45 ms
[2024-06-01 07:53:55] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 13 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 41 ms
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:53:55] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 40 ms
[2024-06-01 07:53:55] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:53:55] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 71 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 1001/1003 places, 961/963 transitions.
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 41 ms
[2024-06-01 07:53:56] [INFO ] Input system was already deterministic with 961 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 40 ms
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 41 ms
[2024-06-01 07:53:56] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 63 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 999/1003 places, 960/963 transitions.
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:53:56] [INFO ] Input system was already deterministic with 960 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:53:56] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 60 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 999/1003 places, 960/963 transitions.
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:53:56] [INFO ] Input system was already deterministic with 960 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:56] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:53:57] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 11 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:53:57] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 53 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 1001/1003 places, 961/963 transitions.
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:53:57] [INFO ] Input system was already deterministic with 961 transitions.
RANDOM walk for 7263 steps (0 resets) in 127 ms. (56 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-040A-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:53:57] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 11 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 1003/1003 places, 963/963 transitions.
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:53:57] [INFO ] Input system was already deterministic with 963 transitions.
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:53:57] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:53:57] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 07:53:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4326 arcs took 7 ms.
Total runtime 113603 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 : ShieldIIPs-PT-040A-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-040A-CTLFireability-2023-15
BK_STOP 1717228438304
--------------------
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 ShieldIIPs-PT-040A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/832/ctl_0_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/832/ctl_1_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/832/ctl_2_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/832/ctl_3_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/832/ctl_4_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/832/ctl_5_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/832/ctl_6_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/832/ctl_7_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/832/ctl_8_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/832/ctl_9_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/832/ctl_10_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/832/ctl_11_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/832/ctl_12_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/832/ctl_13_
ctl formula name ShieldIIPs-PT-040A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/832/ctl_14_
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="ShieldIIPs-PT-040A"
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 ShieldIIPs-PT-040A, 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 r528-tall-171683760400130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040A.tgz
mv ShieldIIPs-PT-040A 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 ;