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.r003-smll-171620117500322.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 greatspnxred
Input is Anderson-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 185K May 18 16:42 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 Anderson-PT-05-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716428398586

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:40:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 01:40:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:40:01] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-23 01:40:01] [INFO ] Transformed 161 places.
[2024-05-23 01:40:01] [INFO ] Transformed 365 transitions.
[2024-05-23 01:40:01] [INFO ] Found NUPN structural information;
[2024-05-23 01:40:01] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 86 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 356
Applied a total of 18 rules in 47 ms. Remains 152 /161 variables (removed 9) and now considering 356/365 (removed 9) transitions.
// Phase 1: matrix 356 rows 152 cols
[2024-05-23 01:40:01] [INFO ] Computed 13 invariants in 36 ms
[2024-05-23 01:40:01] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-23 01:40:01] [INFO ] Invariant cache hit.
[2024-05-23 01:40:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 01:40:02] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2024-05-23 01:40:02] [INFO ] Invariant cache hit.
[2024-05-23 01:40:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 27 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:40:05] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 3 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 2 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 2 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:40:06] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:40:07] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 3 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:40:08] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 3 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:40:09] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 1 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:40:10] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:40:11] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:40:11] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-05-23 01:40:11] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 7 ms to minimize.
[2024-05-23 01:40:11] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2024-05-23 01:40:11] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:40:11] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-23 01:40:11] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:40:12] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 1 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 5 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-23 01:40:16] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 5 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:40:17] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:40:18] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 3 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 2 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:40:21] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:40:22] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:40:23] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:40:23] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2024-05-23 01:40:23] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:40:23] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:40:24] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:40:24] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:40:24] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-05-23 01:40:24] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2024-05-23 01:40:24] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:40:24] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
[2024-05-23 01:40:24] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:28] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-23 01:40:28] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-23 01:40:28] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:40:28] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:40:28] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:40:29] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
[2024-05-23 01:40:29] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-23 01:40:29] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 3 ms to minimize.
[2024-05-23 01:40:29] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:40:29] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 1 ms to minimize.
[2024-05-23 01:40:30] [INFO ] Deduced a trap composed of 92 places in 204 ms of which 3 ms to minimize.
[2024-05-23 01:40:30] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2024-05-23 01:40:30] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 3 ms to minimize.
[2024-05-23 01:40:31] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
[2024-05-23 01:40:31] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:40:31] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:40:31] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2024-05-23 01:40:32] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:40:32] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:40:32] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 152/508 variables, and 133 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/152 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:34] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 3 ms to minimize.
[2024-05-23 01:40:35] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:40:36] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:40:36] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 2 ms to minimize.
[2024-05-23 01:40:36] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 2 ms to minimize.
[2024-05-23 01:40:36] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 2 ms to minimize.
[2024-05-23 01:40:36] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 3 ms to minimize.
[2024-05-23 01:40:37] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-05-23 01:40:37] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-05-23 01:40:37] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:40:37] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-23 01:40:38] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:40:39] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:40:39] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2024-05-23 01:40:39] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 3 ms to minimize.
[2024-05-23 01:40:40] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 3 ms to minimize.
[2024-05-23 01:40:40] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 3 ms to minimize.
[2024-05-23 01:40:40] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 3 ms to minimize.
[2024-05-23 01:40:40] [INFO ] Deduced a trap composed of 94 places in 194 ms of which 3 ms to minimize.
[2024-05-23 01:40:41] [INFO ] Deduced a trap composed of 71 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:43] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 3 ms to minimize.
[2024-05-23 01:40:44] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-05-23 01:40:44] [INFO ] Deduced a trap composed of 110 places in 172 ms of which 2 ms to minimize.
[2024-05-23 01:40:44] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:40:44] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 2 ms to minimize.
[2024-05-23 01:40:46] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 3 ms to minimize.
[2024-05-23 01:40:48] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-23 01:40:49] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 2 ms to minimize.
[2024-05-23 01:40:49] [INFO ] Deduced a trap composed of 76 places in 206 ms of which 3 ms to minimize.
[2024-05-23 01:40:51] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 3 ms to minimize.
[2024-05-23 01:40:51] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 3 ms to minimize.
[2024-05-23 01:40:51] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 3 ms to minimize.
[2024-05-23 01:40:52] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 3 ms to minimize.
[2024-05-23 01:40:52] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 2 ms to minimize.
[2024-05-23 01:40:52] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-23 01:40:52] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 2 ms to minimize.
[2024-05-23 01:40:52] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-05-23 01:40:52] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:40:53] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:40:53] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 01:40:57] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:40:57] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:40:58] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-23 01:40:59] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 3 ms to minimize.
[2024-05-23 01:40:59] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:41:00] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 3 ms to minimize.
[2024-05-23 01:41:00] [INFO ] Deduced a trap composed of 83 places in 168 ms of which 2 ms to minimize.
[2024-05-23 01:41:00] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 3 ms to minimize.
[2024-05-23 01:41:00] [INFO ] Deduced a trap composed of 77 places in 192 ms of which 3 ms to minimize.
[2024-05-23 01:41:01] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 3 ms to minimize.
[2024-05-23 01:41:01] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:41:02] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 3 ms to minimize.
[2024-05-23 01:41:02] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:41:03] [INFO ] Deduced a trap composed of 90 places in 193 ms of which 3 ms to minimize.
[2024-05-23 01:41:03] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 3 ms to minimize.
SMT process timed out in 60877ms, After SMT, problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 60918ms
Starting structural reductions in LTL mode, iteration 1 : 152/161 places, 356/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61926 ms. Remains : 152/161 places, 356/365 transitions.
Support contains 86 out of 152 places after structural reductions.
[2024-05-23 01:41:03] [INFO ] Flatten gal took : 124 ms
[2024-05-23 01:41:03] [INFO ] Flatten gal took : 69 ms
[2024-05-23 01:41:04] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 84 out of 152 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3106 ms. (12 steps per ms) remains 29/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
[2024-05-23 01:41:05] [INFO ] Invariant cache hit.
[2024-05-23 01:41:05] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (OVERLAPS) 117/150 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/152 variables, 4/13 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 356/508 variables, 152/165 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 20/185 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/508 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 185 constraints, problems are : Problem set: 9 solved, 5 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/78 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 66/144 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/152 variables, 7/13 constraints. Problems are: Problem set: 9 solved, 5 unsolved
[2024-05-23 01:41:06] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-23 01:41:06] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 2/15 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 356/508 variables, 152/167 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 20/187 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 5/192 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 0/192 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/508 variables, 0/192 constraints. Problems are: Problem set: 9 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 192 constraints, problems are : Problem set: 9 solved, 5 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 5/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 2161ms problems are : Problem set: 9 solved, 5 unsolved
Parikh walk visited 0 properties in 3537 ms.
Support contains 10 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 152 transition count 338
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 134 transition count 338
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 62 place count 108 transition count 176
Iterating global reduction 0 with 26 rules applied. Total rules applied 88 place count 108 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 106 transition count 174
Applied a total of 92 rules in 53 ms. Remains 106 /152 variables (removed 46) and now considering 174/356 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 106/152 places, 174/356 transitions.
RANDOM walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
// Phase 1: matrix 174 rows 106 cols
[2024-05-23 01:41:11] [INFO ] Computed 13 invariants in 9 ms
[2024-05-23 01:41:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/103 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/280 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 20/20 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/103 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/280 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 174/174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 103 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 102 transition count 146
Applied a total of 8 rules in 38 ms. Remains 102 /106 variables (removed 4) and now considering 146/174 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 102/106 places, 146/174 transitions.
RANDOM walk for 40000 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5748 steps, run visited all 1 properties in 36 ms. (steps per millisecond=159 )
Probabilistic random walk after 5748 steps, saw 3055 distinct states, run finished after 43 ms. (steps per millisecond=133 ) properties seen :1
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 38 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 45 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 356 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 128 transition count 228
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 128 transition count 228
Applied a total of 48 rules in 14 ms. Remains 128 /152 variables (removed 24) and now considering 228/356 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 128/152 places, 228/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 28 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 29 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 10 ms. Remains 122 /152 variables (removed 30) and now considering 166/356 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 122/152 places, 166/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 18 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 9 ms. Remains 122 /152 variables (removed 30) and now considering 166/356 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 122/152 places, 166/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 71 place count 101 transition count 145
Iterating global reduction 0 with 31 rules applied. Total rules applied 102 place count 101 transition count 145
Applied a total of 102 rules in 28 ms. Remains 101 /152 variables (removed 51) and now considering 145/356 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 101/152 places, 145/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 128 transition count 228
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 128 transition count 228
Applied a total of 48 rules in 7 ms. Remains 128 /152 variables (removed 24) and now considering 228/356 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 128/152 places, 228/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 6 ms. Remains 122 /152 variables (removed 30) and now considering 174/356 (removed 182) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 122/152 places, 174/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 203
Applied a total of 50 rules in 6 ms. Remains 127 /152 variables (removed 25) and now considering 203/356 (removed 153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 127/152 places, 203/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 16 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 69 place count 103 transition count 163
Iterating global reduction 0 with 29 rules applied. Total rules applied 98 place count 103 transition count 163
Applied a total of 98 rules in 25 ms. Remains 103 /152 variables (removed 49) and now considering 163/356 (removed 193) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 103/152 places, 163/356 transitions.
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:41:12] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:41:12] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 64 place count 108 transition count 208
Iterating global reduction 0 with 24 rules applied. Total rules applied 88 place count 108 transition count 208
Applied a total of 88 rules in 27 ms. Remains 108 /152 variables (removed 44) and now considering 208/356 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 108/152 places, 208/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 16 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 219
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 219
Applied a total of 50 rules in 7 ms. Remains 127 /152 variables (removed 25) and now considering 219/356 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 127/152 places, 219/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 16 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 192
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 192
Applied a total of 56 rules in 6 ms. Remains 124 /152 variables (removed 28) and now considering 192/356 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 124/152 places, 192/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 257
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 257
Applied a total of 38 rules in 7 ms. Remains 133 /152 variables (removed 19) and now considering 257/356 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 133/152 places, 257/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 18 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 126 transition count 194
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 126 transition count 194
Applied a total of 52 rules in 6 ms. Remains 126 /152 variables (removed 26) and now considering 194/356 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 126/152 places, 194/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 201
Applied a total of 54 rules in 6 ms. Remains 125 /152 variables (removed 27) and now considering 201/356 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 125/152 places, 201/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 6 ms. Remains 122 /152 variables (removed 30) and now considering 174/356 (removed 182) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 122/152 places, 174/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 123 transition count 175
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 123 transition count 175
Applied a total of 58 rules in 7 ms. Remains 123 /152 variables (removed 29) and now considering 175/356 (removed 181) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 123/152 places, 175/356 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:41:13] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 23 ms
[2024-05-23 01:41:13] [INFO ] Flatten gal took : 23 ms
[2024-05-23 01:41:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-05-23 01:41:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 152 places, 356 transitions and 1362 arcs took 7 ms.
Total runtime 72887 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 152
TRANSITIONS: 356
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1106
MODEL NAME: /home/mcc/execution/412/model
152 places, 356 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Anderson-PT-05-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-05-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716428557245

--------------------
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

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="Anderson-PT-05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Anderson-PT-05, 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 r003-smll-171620117500322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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