Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398300466.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 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 63K 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 BusinessProcesses-PT-03-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716302563794

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:42:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:42:47] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-21 14:42:47] [INFO ] Transformed 274 places.
[2024-05-21 14:42:47] [INFO ] Transformed 237 transitions.
[2024-05-21 14:42:47] [INFO ] Found NUPN structural information;
[2024-05-21 14:42:48] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 653 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 45 ms.
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 1 transitions.
Support contains 114 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 249 transition count 214
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 249 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 249 transition count 213
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 241 transition count 205
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 241 transition count 205
Applied a total of 63 rules in 189 ms. Remains 241 /273 variables (removed 32) and now considering 205/236 (removed 31) transitions.
// Phase 1: matrix 205 rows 241 cols
[2024-05-21 14:42:48] [INFO ] Computed 41 invariants in 68 ms
[2024-05-21 14:42:49] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-05-21 14:42:49] [INFO ] Invariant cache hit.
[2024-05-21 14:42:51] [INFO ] Implicit Places using invariants and state equation in 2036 ms returned []
Implicit Place search using SMT with State Equation took 3149 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-21 14:42:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 10 places in 1094 ms of which 43 ms to minimize.
[2024-05-21 14:42:59] [INFO ] Deduced a trap composed of 9 places in 1337 ms of which 12 ms to minimize.
[2024-05-21 14:42:59] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 2 ms to minimize.
[2024-05-21 14:43:01] [INFO ] Deduced a trap composed of 12 places in 2153 ms of which 3 ms to minimize.
[2024-05-21 14:43:02] [INFO ] Deduced a trap composed of 14 places in 1398 ms of which 3 ms to minimize.
[2024-05-21 14:43:03] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-21 14:43:03] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 1 ms to minimize.
[2024-05-21 14:43:03] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-21 14:43:03] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 2 ms to minimize.
[2024-05-21 14:43:03] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 7 ms to minimize.
[2024-05-21 14:43:05] [INFO ] Deduced a trap composed of 16 places in 1843 ms of which 11 ms to minimize.
[2024-05-21 14:43:05] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-21 14:43:07] [INFO ] Deduced a trap composed of 18 places in 1584 ms of which 18 ms to minimize.
[2024-05-21 14:43:07] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-05-21 14:43:07] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2024-05-21 14:43:09] [INFO ] Deduced a trap composed of 25 places in 1677 ms of which 7 ms to minimize.
[2024-05-21 14:43:09] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-05-21 14:43:10] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 1 ms to minimize.
[2024-05-21 14:43:10] [INFO ] Deduced a trap composed of 18 places in 503 ms of which 34 ms to minimize.
[2024-05-21 14:43:11] [INFO ] Deduced a trap composed of 19 places in 1098 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 14:43:12] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-21 14:43:13] [INFO ] Deduced a trap composed of 27 places in 1058 ms of which 13 ms to minimize.
[2024-05-21 14:43:13] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 22 places in 764 ms of which 6 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2024-05-21 14:43:15] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-21 14:43:15] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 54 ms to minimize.
[2024-05-21 14:43:15] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-21 14:43:15] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 3 ms to minimize.
[2024-05-21 14:43:15] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 3 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 2 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 3 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 20 ms to minimize.
[2024-05-21 14:43:17] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-21 14:43:19] [INFO ] Deduced a trap composed of 25 places in 2043 ms of which 3 ms to minimize.
[2024-05-21 14:43:19] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-21 14:43:19] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
[2024-05-21 14:43:21] [INFO ] Deduced a trap composed of 23 places in 1943 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/446 variables, and 81 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 14:43:30] [INFO ] Deduced a trap composed of 25 places in 1404 ms of which 1 ms to minimize.
[2024-05-21 14:43:31] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 3 ms to minimize.
[2024-05-21 14:43:31] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-05-21 14:43:31] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 10 ms to minimize.
[2024-05-21 14:43:31] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2024-05-21 14:43:31] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-21 14:43:31] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-21 14:43:31] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 3 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 9 ms to minimize.
[2024-05-21 14:43:32] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:43:33] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2024-05-21 14:43:33] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 14:43:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 14:43:33] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-21 14:43:33] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 4 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:43:34] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 205/446 variables, 241/366 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 204/570 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 14:43:48] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-21 14:43:48] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-21 14:43:48] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-05-21 14:43:50] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:43:50] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-21 14:43:50] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-21 14:43:50] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:43:50] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:43:51] [INFO ] Deduced a trap composed of 35 places in 1323 ms of which 7 ms to minimize.
[2024-05-21 14:43:52] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 585 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 99/99 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 241/273 places, 205/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63835 ms. Remains : 241/273 places, 205/236 transitions.
Support contains 114 out of 241 places after structural reductions.
[2024-05-21 14:43:52] [INFO ] Flatten gal took : 66 ms
[2024-05-21 14:43:52] [INFO ] Flatten gal took : 30 ms
[2024-05-21 14:43:52] [INFO ] Input system was already deterministic with 205 transitions.
RANDOM walk for 40000 steps (472 resets) in 2903 ms. (13 steps per ms) remains 13/83 properties
BEST_FIRST walk for 40003 steps (92 resets) in 299 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (94 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (90 resets) in 123 ms. (322 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (77 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (89 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (91 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (95 resets) in 115 ms. (344 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (78 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
[2024-05-21 14:43:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 138/155 variables, 28/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 61/216 variables, 13/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 187/403 variables, 216/257 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 7 (OVERLAPS) 40/443 variables, 23/280 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/280 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/446 variables, 2/282 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/446 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 282 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2908 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 141/214 variables, 32/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 14:43:57] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 9/51 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 177/391 variables, 214/265 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 2/267 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 1/268 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 2/270 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 2/272 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 40/431 variables, 17/289 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/290 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:43:58] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 7/297 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:43:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 9/306 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 0/306 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/443 variables, 8/314 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 0/314 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 3/446 variables, 2/316 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/446 variables, 0/316 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/446 variables, 0/316 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 316 constraints, problems are : Problem set: 4 solved, 2 unsolved in 2766 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 31/31 constraints]
After SMT, in 5684ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 1 properties in 94 ms.
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 205/205 transitions.
Graph (trivial) has 136 edges and 241 vertex of which 6 / 241 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 474 edges and 236 vertex of which 235 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 235 transition count 153
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 192 transition count 153
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 88 place count 192 transition count 115
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 174 place count 144 transition count 115
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 202 place count 116 transition count 87
Ensure Unique test removed 2 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 232 place count 114 transition count 87
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 232 place count 114 transition count 84
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 238 place count 111 transition count 84
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 326 place count 67 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 327 place count 66 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 328 place count 65 transition count 39
Applied a total of 328 rules in 48 ms. Remains 65 /241 variables (removed 176) and now considering 39/205 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 65/241 places, 39/205 transitions.
RANDOM walk for 40000 steps (1497 resets) in 453 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 343 steps (0 resets) in 5 ms. (57 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 15 ms
[2024-05-21 14:44:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 205 transitions.
Support contains 103 out of 241 places (down from 105) after GAL structural reductions.
Computed a total of 235 stabilizing places and 197 stable transitions
Graph (complete) has 481 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 214 transition count 178
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 214 transition count 178
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 207 transition count 171
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 19 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 207/241 places, 171/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 203 transition count 167
Applied a total of 76 rules in 26 ms. Remains 203 /241 variables (removed 38) and now considering 167/205 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 203/241 places, 167/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 207 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 16 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 207/241 places, 171/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 205 transition count 169
Applied a total of 72 rules in 16 ms. Remains 205 /241 variables (removed 36) and now considering 169/205 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 205/241 places, 169/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 17 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 16 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 16 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 206 transition count 170
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 206 transition count 170
Applied a total of 70 rules in 15 ms. Remains 206 /241 variables (removed 35) and now considering 170/205 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 206/241 places, 170/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 217 transition count 181
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 217 transition count 181
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 210 transition count 174
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 210 transition count 174
Applied a total of 62 rules in 18 ms. Remains 210 /241 variables (removed 31) and now considering 174/205 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 210/241 places, 174/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 210 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 202 transition count 166
Applied a total of 78 rules in 19 ms. Remains 202 /241 variables (removed 39) and now considering 166/205 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 202/241 places, 166/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 210 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 202 transition count 166
Applied a total of 78 rules in 14 ms. Remains 202 /241 variables (removed 39) and now considering 166/205 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 202/241 places, 166/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 203 transition count 167
Applied a total of 76 rules in 12 ms. Remains 203 /241 variables (removed 38) and now considering 167/205 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 203/241 places, 167/205 transitions.
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:44:00] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:44:00] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Graph (trivial) has 138 edges and 241 vertex of which 6 / 241 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 475 edges and 236 vertex of which 235 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 234 transition count 155
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 192 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 191 transition count 154
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 88 place count 191 transition count 115
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 176 place count 142 transition count 115
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 204 place count 114 transition count 87
Ensure Unique test removed 2 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 234 place count 112 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 234 place count 112 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 238 place count 110 transition count 85
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 328 place count 65 transition count 40
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 330 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 62 transition count 38
Applied a total of 332 rules in 30 ms. Remains 62 /241 variables (removed 179) and now considering 38/205 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 62/241 places, 38/205 transitions.
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:44:01] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 207 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 11 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 207/241 places, 171/205 transitions.
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:44:01] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 204 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 13 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:44:01] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:44:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:44:01] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-21 14:44:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 241 places, 205 transitions and 566 arcs took 2 ms.
Total runtime 73862 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-03

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 988
MODEL NAME: /home/mcc/execution/419/model
241 places, 205 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...

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BusinessProcesses-PT-03"
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 BusinessProcesses-PT-03, 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 r047-tajo-171620398300466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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