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-171683762200970.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 ShieldRVt-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762200970
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 21:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 21:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 119K 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 ShieldRVt-PT-010B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717275903146

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:05:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:05:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:05:04] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-01 21:05:04] [INFO ] Transformed 503 places.
[2024-06-01 21:05:04] [INFO ] Transformed 503 transitions.
[2024-06-01 21:05:04] [INFO ] Found NUPN structural information;
[2024-06-01 21:05:04] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 125 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 435 transition count 435
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 435 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 434 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 434 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 433 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 433 transition count 433
Applied a total of 140 rules in 99 ms. Remains 433 /503 variables (removed 70) and now considering 433/503 (removed 70) transitions.
// Phase 1: matrix 433 rows 433 cols
[2024-06-01 21:05:04] [INFO ] Computed 41 invariants in 19 ms
[2024-06-01 21:05:05] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 21:05:05] [INFO ] Invariant cache hit.
[2024-06-01 21:05:05] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-01 21:05:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/433 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 19 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 3 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 2 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 21:05:11] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 21:05:12] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:05:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:05:13] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:13] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 21:05:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:05:13] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:05:13] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 21:05:13] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:05:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:05:14] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:05:14] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:05:15] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:05:16] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:05:16] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:20] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 2 ms to minimize.
[2024-06-01 21:05:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:24] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:05:24] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-01 21:05:24] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:05:25] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:05:25] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 4 ms to minimize.
[2024-06-01 21:05:25] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:05:25] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:27] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:05:28] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 21:05:28] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (OVERLAPS) 433/866 variables, 433/536 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/866 variables, and 536 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/433 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 62/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/866 variables, 433/536 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 432/968 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:42] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:05:42] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:05:42] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:05:42] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:05:43] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:05:43] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:05:43] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:05:43] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:05:43] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 21:05:43] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-01 21:05:44] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:05:44] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 3 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-06-01 21:05:45] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 20/988 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:48] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 21:05:49] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:05:49] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-06-01 21:05:50] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 3 ms to minimize.
[2024-06-01 21:05:50] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:05:50] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:05:50] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
[2024-06-01 21:05:51] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-06-01 21:05:51] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-06-01 21:05:51] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-06-01 21:05:51] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 21:05:52] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-06-01 21:05:52] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 5 ms to minimize.
[2024-06-01 21:05:52] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 3 ms to minimize.
[2024-06-01 21:05:52] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-06-01 21:05:52] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 21:05:52] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:05:53] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:05:53] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:05:53] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 20/1008 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 21:05:56] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:05:56] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-06-01 21:05:59] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-06-01 21:05:59] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
[2024-06-01 21:05:59] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-06-01 21:05:59] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-06-01 21:05:59] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:05:59] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:06:00] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 21:06:00] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 3 ms to minimize.
[2024-06-01 21:06:00] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:06:01] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:06:01] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:06:01] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:06:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:06:02] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-01 21:06:02] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:06:02] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 3 ms to minimize.
[2024-06-01 21:06:02] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:06:02] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 20/1028 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/866 variables, and 1028 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 122/122 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 433/503 places, 433/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60884 ms. Remains : 433/503 places, 433/503 transitions.
Support contains 125 out of 433 places after structural reductions.
[2024-06-01 21:06:05] [INFO ] Flatten gal took : 57 ms
[2024-06-01 21:06:05] [INFO ] Flatten gal took : 23 ms
[2024-06-01 21:06:05] [INFO ] Input system was already deterministic with 433 transitions.
RANDOM walk for 40000 steps (8 resets) in 1443 ms. (27 steps per ms) remains 5/84 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
[2024-06-01 21:06:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 154/166 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 267/433 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:06] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-06-01 21:06:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 8 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-01 21:06:07] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 433/866 variables, 433/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/866 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 489 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 154/166 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 267/433 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 433/866 variables, 433/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 3 ms to minimize.
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:06:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/866 variables, 5/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/866 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/866 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/866 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:06:09] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/866 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/866 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/866 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 510 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2034 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 33/33 constraints]
After SMT, in 3440ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1631 ms.
Support contains 12 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 433/433 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 433 transition count 325
Reduce places removed 108 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 217 place count 325 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 324 transition count 324
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 218 place count 324 transition count 262
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 342 place count 262 transition count 262
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 371 place count 233 transition count 233
Iterating global reduction 3 with 29 rules applied. Total rules applied 400 place count 233 transition count 233
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 400 place count 233 transition count 214
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 438 place count 214 transition count 214
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 610 place count 128 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 128 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 613 place count 127 transition count 126
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 669 place count 99 transition count 151
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 670 place count 99 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 671 place count 98 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 672 place count 97 transition count 149
Applied a total of 672 rules in 96 ms. Remains 97 /433 variables (removed 336) and now considering 149/433 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 97/433 places, 149/433 transitions.
RANDOM walk for 40000 steps (15 resets) in 615 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 103 ms. (384 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 64 ms. (615 steps per ms) remains 1/2 properties
// Phase 1: matrix 149 rows 97 cols
[2024-06-01 21:06:12] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 21:06:12] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/73 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/159 variables, 32/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:06:12] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/161 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 65/226 variables, 27/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/227 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/227 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/232 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/232 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 14/246 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/246 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/246 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/246 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/73 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/159 variables, 32/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/161 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/226 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/227 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/232 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/232 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 14/246 variables, 11/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/246 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/246 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 149/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 148
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 96 transition count 145
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 93 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 90 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 88 transition count 140
Applied a total of 16 rules in 14 ms. Remains 88 /97 variables (removed 9) and now considering 140/149 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 88/97 places, 140/149 transitions.
RANDOM walk for 40000 steps (13 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1543324 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :0 out of 1
Probabilistic random walk after 1543324 steps, saw 980612 distinct states, run finished after 3004 ms. (steps per millisecond=513 ) properties seen :0
// Phase 1: matrix 140 rows 88 cols
[2024-06-01 21:06:15] [INFO ] Computed 40 invariants in 4 ms
[2024-06-01 21:06:15] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/69 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/148 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 63/211 variables, 26/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/228 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/69 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/148 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 63/211 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 17/228 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/228 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 140/140 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/88 places, 140/140 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-06-01 21:06:15] [INFO ] Invariant cache hit.
[2024-06-01 21:06:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 21:06:15] [INFO ] Invariant cache hit.
[2024-06-01 21:06:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 21:06:15] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-01 21:06:15] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 21:06:15] [INFO ] Invariant cache hit.
[2024-06-01 21:06:15] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 140/228 variables, 88/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 138 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2238 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 140/228 variables, 88/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 138/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 276 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2482 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 4764ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 4766ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4969 ms. Remains : 88/88 places, 140/140 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 37 edges and 88 vertex of which 4 / 88 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 274 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 83 transition count 131
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 81 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 81 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 81 transition count 123
Applied a total of 16 rules in 27 ms. Remains 81 /88 variables (removed 7) and now considering 123/140 (removed 17) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 81 cols
[2024-06-01 21:06:20] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 21:06:20] [INFO ] [Real]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-06-01 21:06:20] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 21:06:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-06-01 21:06:20] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 21:06:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 21:06:20] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 21:06:20] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 21:06:20] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
[2024-06-01 21:06:20] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:06:20] [INFO ] Flatten gal took : 21 ms
[2024-06-01 21:06:20] [INFO ] Input system was already deterministic with 433 transitions.
Computed a total of 129 stabilizing places and 129 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 397 transition count 397
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 397 transition count 397
Applied a total of 72 rules in 10 ms. Remains 397 /433 variables (removed 36) and now considering 397/433 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 397/433 places, 397/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 15 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 15 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 432 transition count 324
Reduce places removed 108 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 324 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 322 transition count 322
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 220 place count 322 transition count 259
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 346 place count 259 transition count 259
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 374 place count 231 transition count 231
Iterating global reduction 3 with 28 rules applied. Total rules applied 402 place count 231 transition count 231
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 402 place count 231 transition count 213
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 438 place count 213 transition count 213
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 588 place count 138 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 589 place count 138 transition count 137
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 4 with 2 rules applied. Total rules applied 591 place count 137 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 592 place count 137 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 594 place count 135 transition count 134
Applied a total of 594 rules in 42 ms. Remains 135 /433 variables (removed 298) and now considering 134/433 (removed 299) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 135/433 places, 134/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 6 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 6 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 397 transition count 397
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 397 transition count 397
Applied a total of 72 rules in 10 ms. Remains 397 /433 variables (removed 36) and now considering 397/433 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 397/433 places, 397/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 432 transition count 318
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 229 place count 318 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 317 transition count 317
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 230 place count 317 transition count 256
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 352 place count 256 transition count 256
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 382 place count 226 transition count 226
Iterating global reduction 3 with 30 rules applied. Total rules applied 412 place count 226 transition count 226
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 412 place count 226 transition count 205
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 454 place count 205 transition count 205
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 608 place count 128 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 609 place count 128 transition count 127
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 4 with 2 rules applied. Total rules applied 611 place count 127 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 613 place count 125 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 614 place count 124 transition count 124
Applied a total of 614 rules in 34 ms. Remains 124 /433 variables (removed 309) and now considering 124/433 (removed 309) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 124/433 places, 124/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 5 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 6 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 432 transition count 315
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 315 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 314 transition count 314
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 236 place count 314 transition count 253
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 358 place count 253 transition count 253
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 387 place count 224 transition count 224
Iterating global reduction 3 with 29 rules applied. Total rules applied 416 place count 224 transition count 224
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 416 place count 224 transition count 205
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 454 place count 205 transition count 205
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 614 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 125 transition count 124
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 4 with 2 rules applied. Total rules applied 617 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 619 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 620 place count 121 transition count 121
Applied a total of 620 rules in 28 ms. Remains 121 /433 variables (removed 312) and now considering 121/433 (removed 312) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 121/433 places, 121/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 5 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 391 transition count 391
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 391 transition count 391
Applied a total of 84 rules in 9 ms. Remains 391 /433 variables (removed 42) and now considering 391/433 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 391/433 places, 391/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 391 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 392 transition count 392
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 392 transition count 392
Applied a total of 82 rules in 9 ms. Remains 392 /433 variables (removed 41) and now considering 392/433 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 392/433 places, 392/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 11 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 432 transition count 316
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 316 transition count 316
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 232 place count 316 transition count 254
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 356 place count 254 transition count 254
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 383 place count 227 transition count 227
Iterating global reduction 2 with 27 rules applied. Total rules applied 410 place count 227 transition count 227
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 410 place count 227 transition count 208
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 448 place count 208 transition count 208
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 604 place count 130 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 605 place count 130 transition count 129
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 607 place count 129 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 127 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 610 place count 126 transition count 126
Applied a total of 610 rules in 26 ms. Remains 126 /433 variables (removed 307) and now considering 126/433 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 126/433 places, 126/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 5 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 5 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 393 transition count 393
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 393 transition count 393
Applied a total of 80 rules in 8 ms. Remains 393 /433 variables (removed 40) and now considering 393/433 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 393/433 places, 393/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 10 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 10 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 396 transition count 396
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 396 transition count 396
Applied a total of 74 rules in 8 ms. Remains 396 /433 variables (removed 37) and now considering 396/433 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 396/433 places, 396/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 11 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 10 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 432 transition count 315
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 315 transition count 315
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 234 place count 315 transition count 254
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 356 place count 254 transition count 254
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 386 place count 224 transition count 224
Iterating global reduction 2 with 30 rules applied. Total rules applied 416 place count 224 transition count 224
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 416 place count 224 transition count 203
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 458 place count 203 transition count 203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 616 place count 124 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 124 transition count 123
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 619 place count 123 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 621 place count 121 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 622 place count 120 transition count 120
Applied a total of 622 rules in 26 ms. Remains 120 /433 variables (removed 313) and now considering 120/433 (removed 313) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 120/433 places, 120/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 5 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 120 transitions.
RANDOM walk for 402 steps (0 resets) in 13 ms. (28 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-010B-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 393 transition count 393
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 393 transition count 393
Applied a total of 80 rules in 8 ms. Remains 393 /433 variables (removed 40) and now considering 393/433 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 393/433 places, 393/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 10 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 432 transition count 315
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 315 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 314 transition count 314
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 236 place count 314 transition count 253
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 358 place count 253 transition count 253
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 388 place count 223 transition count 223
Iterating global reduction 3 with 30 rules applied. Total rules applied 418 place count 223 transition count 223
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 418 place count 223 transition count 202
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 460 place count 202 transition count 202
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 614 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 125 transition count 124
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 4 with 2 rules applied. Total rules applied 617 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 619 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 620 place count 121 transition count 121
Applied a total of 620 rules in 23 ms. Remains 121 /433 variables (removed 312) and now considering 121/433 (removed 312) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 121/433 places, 121/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 391 transition count 391
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 391 transition count 391
Applied a total of 84 rules in 8 ms. Remains 391 /433 variables (removed 42) and now considering 391/433 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 391/433 places, 391/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 391 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 398 transition count 398
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 398 transition count 398
Applied a total of 70 rules in 8 ms. Remains 398 /433 variables (removed 35) and now considering 398/433 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 398/433 places, 398/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 399 transition count 399
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 399 transition count 399
Applied a total of 68 rules in 7 ms. Remains 399 /433 variables (removed 34) and now considering 399/433 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 399/433 places, 399/433 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 8 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Input system was already deterministic with 399 transitions.
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Flatten gal took : 9 ms
[2024-06-01 21:06:21] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 21:06:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 433 places, 433 transitions and 1046 arcs took 6 ms.
Total runtime 77624 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 : ShieldRVt-PT-010B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-2023-15

BK_STOP 1717275982332

--------------------
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 ShieldRVt-PT-010B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1039/ctl_0_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1039/ctl_1_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1039/ctl_2_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1039/ctl_3_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1039/ctl_4_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1039/ctl_5_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1039/ctl_6_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1039/ctl_7_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1039/ctl_8_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1039/ctl_9_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1039/ctl_10_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1039/ctl_11_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1039/ctl_12_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1039/ctl_13_
ctl formula name ShieldRVt-PT-010B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1039/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="ShieldRVt-PT-010B"
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 ShieldRVt-PT-010B, 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-171683762200970"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B 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 ;