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-171620398600602.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-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398600602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 192K 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-20-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716309201203

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:33:23] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-21 16:33:23] [INFO ] Transformed 782 places.
[2024-05-21 16:33:23] [INFO ] Transformed 697 transitions.
[2024-05-21 16:33:23] [INFO ] Found NUPN structural information;
[2024-05-21 16:33:23] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 29 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 107 place count 612 transition count 545
Iterating global reduction 1 with 93 rules applied. Total rules applied 200 place count 612 transition count 545
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 243 place count 569 transition count 502
Iterating global reduction 1 with 43 rules applied. Total rules applied 286 place count 569 transition count 502
Applied a total of 286 rules in 147 ms. Remains 569 /719 variables (removed 150) and now considering 502/638 (removed 136) transitions.
// Phase 1: matrix 502 rows 569 cols
[2024-05-21 16:33:23] [INFO ] Computed 107 invariants in 22 ms
[2024-05-21 16:33:24] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-21 16:33:24] [INFO ] Invariant cache hit.
[2024-05-21 16:33:24] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-21 16:33:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:33:38] [INFO ] Deduced a trap composed of 95 places in 208 ms of which 28 ms to minimize.
[2024-05-21 16:33:38] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:33:38] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:33:38] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:33:38] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:33:38] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:33:39] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:33:39] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:33:39] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:33:39] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:33:39] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:33:39] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:33:39] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:33:40] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:33:40] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:33:40] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:33:40] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:33:40] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 6 ms to minimize.
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 4 ms to minimize.
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 4 ms to minimize.
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 6 ms to minimize.
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 4 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 4 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 5 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 4 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 4 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 4 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 4 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 4 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:33:46] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:33:46] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:33:46] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:33:46] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 4 ms to minimize.
[2024-05-21 16:33:46] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 4 ms to minimize.
[2024-05-21 16:33:46] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:33:47] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:33:47] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:33:47] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 4 ms to minimize.
[2024-05-21 16:33:47] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:33:47] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:33:47] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:33:48] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 4 ms to minimize.
[2024-05-21 16:33:48] [INFO ] Deduced a trap composed of 85 places in 203 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:33:53] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:33:53] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:33:53] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:33:53] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:33:53] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:33:53] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 4 ms to minimize.
[2024-05-21 16:33:54] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:33:54] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:33:54] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:33:54] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:33:54] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:33:54] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:33:55] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:33:55] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
SMT process timed out in 30241ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 30261ms
Starting structural reductions in LTL mode, iteration 1 : 569/719 places, 502/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31775 ms. Remains : 569/719 places, 502/638 transitions.
Support contains 95 out of 569 places after structural reductions.
[2024-05-21 16:33:55] [INFO ] Flatten gal took : 65 ms
[2024-05-21 16:33:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:33:55] [INFO ] Flatten gal took : 28 ms
[2024-05-21 16:33:55] [INFO ] Input system was already deterministic with 502 transitions.
Support contains 89 out of 569 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (198 resets) in 2449 ms. (16 steps per ms) remains 26/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
[2024-05-21 16:33:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 392/439 variables, 65/65 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 121/560 variables, 41/106 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/561 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 496/1057 variables, 561/668 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1057 variables, 0/668 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 9 (OVERLAPS) 13/1070 variables, 7/675 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1070 variables, 0/675 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 1/1071 variables, 1/676 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1071 variables, 0/676 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 0/1071 variables, 0/676 constraints. Problems are: Problem set: 2 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1071/1071 variables, and 676 constraints, problems are : Problem set: 2 solved, 24 unsolved in 2231 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 569/569 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 395/439 variables, 65/65 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-05-21 16:33:58] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 3 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 7296ms, After SMT, problems are : Problem set: 2 solved, 24 unsolved
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 44 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (complete) has 1250 edges and 569 vertex of which 566 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 566 transition count 433
Reduce places removed 66 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 72 rules applied. Total rules applied 139 place count 500 transition count 427
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 145 place count 494 transition count 427
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 145 place count 494 transition count 322
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 229 rules applied. Total rules applied 374 place count 370 transition count 322
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 387 place count 357 transition count 309
Iterating global reduction 3 with 13 rules applied. Total rules applied 400 place count 357 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 400 place count 357 transition count 307
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 404 place count 355 transition count 307
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 647 place count 232 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 232 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 650 place count 231 transition count 189
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 651 place count 231 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 652 place count 230 transition count 188
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 660 place count 230 transition count 188
Applied a total of 660 rules in 142 ms. Remains 230 /569 variables (removed 339) and now considering 188/502 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 230/569 places, 188/502 transitions.
RANDOM walk for 40000 steps (1644 resets) in 981 ms. (40 steps per ms) remains 20/24 properties
BEST_FIRST walk for 4003 steps (44 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (54 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (43 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (51 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (47 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (53 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (42 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (47 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (42 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (41 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (47 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (43 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (45 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (40 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
// Phase 1: matrix 188 rows 230 cols
[2024-05-21 16:34:04] [INFO ] Computed 85 invariants in 5 ms
[2024-05-21 16:34:04] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 157/194 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 34/228 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 188/416 variables, 228/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2/418 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 320 constraints, problems are : Problem set: 0 solved, 20 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 230/230 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 157/194 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 2 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 16/101 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:34:08] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 15/116 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (OVERLAPS) 34/228 variables, 20/136 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:34:09] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:34:10] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:34:10] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 7/143 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 188/416 variables, 228/371 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 5/376 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 18/394 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 20/414 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 1 ms to minimize.
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 18/432 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 3/435 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/435 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 2/418 variables, 2/437 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:17] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-21 16:34:17] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:34:17] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:34:17] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:34:17] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2024-05-21 16:34:17] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 6/443 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:18] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 1/444 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 0/444 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:19] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:34:19] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:34:20] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/418 variables, 3/447 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:21] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 1/448 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:21] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 1/449 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 1/450 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/418 variables, 0/450 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:24] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/418 variables, 1/451 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 16:34:25] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:34:25] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:34:26] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:34:26] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:34:26] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:34:26] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:34:26] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:34:26] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/418 variables, 8/459 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/418 variables, 0/459 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 28 (OVERLAPS) 0/418 variables, 0/459 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 459 constraints, problems are : Problem set: 2 solved, 18 unsolved in 23239 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 230/230 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 18/20 constraints, Known Traps: 121/121 constraints]
After SMT, in 24083ms problems are : Problem set: 2 solved, 18 unsolved
Parikh walk visited 17 properties in 2900 ms.
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 188/188 transitions.
Graph (trivial) has 32 edges and 230 vertex of which 2 / 230 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 229 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 227 transition count 184
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 5 place count 227 transition count 173
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 30 place count 213 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 210 transition count 170
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 210 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 210 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 209 transition count 169
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 87 place count 184 transition count 145
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 184 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 181 transition count 142
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 181 transition count 142
Applied a total of 94 rules in 56 ms. Remains 181 /230 variables (removed 49) and now considering 142/188 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 181/230 places, 142/188 transitions.
RANDOM walk for 35412 steps (1739 resets) in 1014 ms. (34 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-05-21 16:34:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 29 ms
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 27 ms
[2024-05-21 16:34:32] [INFO ] Input system was already deterministic with 502 transitions.
Support contains 65 out of 569 places (down from 80) after GAL structural reductions.
Computed a total of 496 stabilizing places and 439 stable transitions
Graph (complete) has 1250 edges and 569 vertex of which 566 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.29 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 411
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 479 transition count 411
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 164 place count 479 transition count 298
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 412 place count 344 transition count 298
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 435 place count 321 transition count 275
Iterating global reduction 2 with 23 rules applied. Total rules applied 458 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 272
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 464 place count 318 transition count 272
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 726 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 142
Applied a total of 728 rules in 85 ms. Remains 183 /569 variables (removed 386) and now considering 142/502 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 85 ms. Remains : 183/569 places, 142/502 transitions.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:34:32] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 8 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 479
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 479
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 472
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 472
Applied a total of 60 rules in 47 ms. Remains 539 /569 variables (removed 30) and now considering 472/502 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 539/569 places, 472/502 transitions.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 26 ms
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 24 ms
[2024-05-21 16:34:32] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 278 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 560 transition count 412
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 480 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 479 transition count 411
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 164 place count 479 transition count 302
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 403 place count 349 transition count 302
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 424 place count 328 transition count 281
Iterating global reduction 3 with 21 rules applied. Total rules applied 445 place count 328 transition count 281
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 445 place count 328 transition count 278
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 451 place count 325 transition count 278
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 710 place count 194 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 193 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 712 place count 192 transition count 149
Applied a total of 712 rules in 70 ms. Remains 192 /569 variables (removed 377) and now considering 149/502 (removed 353) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 192/569 places, 149/502 transitions.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:34:32] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 560 transition count 410
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 478 transition count 410
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 166 place count 478 transition count 298
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 412 place count 344 transition count 298
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 435 place count 321 transition count 275
Iterating global reduction 2 with 23 rules applied. Total rules applied 458 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 272
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 464 place count 318 transition count 272
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 726 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 142
Applied a total of 728 rules in 61 ms. Remains 183 /569 variables (removed 386) and now considering 142/502 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 183/569 places, 142/502 transitions.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 16:34:32] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 478
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 471
Applied a total of 62 rules in 34 ms. Remains 538 /569 variables (removed 31) and now considering 471/502 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 538/569 places, 471/502 transitions.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 21 ms
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 20 ms
[2024-05-21 16:34:32] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 479
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 479
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 472
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 472
Applied a total of 60 rules in 30 ms. Remains 539 /569 variables (removed 30) and now considering 472/502 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 539/569 places, 472/502 transitions.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:34:32] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 478
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 471
Applied a total of 62 rules in 32 ms. Remains 538 /569 variables (removed 31) and now considering 471/502 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 538/569 places, 471/502 transitions.
[2024-05-21 16:34:32] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:34:33] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 276 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 411
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 479 transition count 411
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 164 place count 479 transition count 305
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 397 place count 352 transition count 305
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 418 place count 331 transition count 284
Iterating global reduction 2 with 21 rules applied. Total rules applied 439 place count 331 transition count 284
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 439 place count 331 transition count 281
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 445 place count 328 transition count 281
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 711 place count 193 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 712 place count 192 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 713 place count 191 transition count 149
Applied a total of 713 rules in 46 ms. Remains 191 /569 variables (removed 378) and now considering 149/502 (removed 353) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 191/569 places, 149/502 transitions.
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:34:33] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 281 edges and 569 vertex of which 6 / 569 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 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 560 transition count 410
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 478 transition count 410
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 166 place count 478 transition count 300
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 408 place count 346 transition count 300
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 431 place count 323 transition count 277
Iterating global reduction 2 with 23 rules applied. Total rules applied 454 place count 323 transition count 277
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 454 place count 323 transition count 274
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 460 place count 320 transition count 274
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 726 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 142
Applied a total of 728 rules in 40 ms. Remains 183 /569 variables (removed 386) and now considering 142/502 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 183/569 places, 142/502 transitions.
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 16:34:33] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 40000 steps (5160 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1190 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1008 steps, run visited all 1 properties in 15 ms. (steps per millisecond=67 )
Probabilistic random walk after 1008 steps, saw 460 distinct states, run finished after 19 ms. (steps per millisecond=53 ) properties seen :1
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 548 transition count 481
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 548 transition count 481
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 543 transition count 476
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 543 transition count 476
Applied a total of 52 rules in 23 ms. Remains 543 /569 variables (removed 26) and now considering 476/502 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 543/569 places, 476/502 transitions.
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:34:33] [INFO ] Input system was already deterministic with 476 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Graph (trivial) has 282 edges and 569 vertex of which 6 / 569 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 1244 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 411
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 479 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 478 transition count 410
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 166 place count 478 transition count 298
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 412 place count 344 transition count 298
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 435 place count 321 transition count 275
Iterating global reduction 3 with 23 rules applied. Total rules applied 458 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 272
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 464 place count 318 transition count 272
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 728 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 183 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 182 transition count 141
Applied a total of 730 rules in 41 ms. Remains 182 /569 variables (removed 387) and now considering 141/502 (removed 361) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 182/569 places, 141/502 transitions.
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:34:33] [INFO ] Input system was already deterministic with 141 transitions.
RANDOM walk for 13895 steps (1791 resets) in 68 ms. (201 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 549 transition count 482
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 549 transition count 482
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 542 transition count 475
Applied a total of 54 rules in 29 ms. Remains 542 /569 variables (removed 27) and now considering 475/502 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 542/569 places, 475/502 transitions.
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:34:33] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 502/502 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 547 transition count 480
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 547 transition count 480
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 540 transition count 473
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 540 transition count 473
Applied a total of 58 rules in 28 ms. Remains 540 /569 variables (removed 29) and now considering 473/502 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 540/569 places, 473/502 transitions.
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:34:33] [INFO ] Input system was already deterministic with 473 transitions.
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:34:33] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:34:33] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-21 16:34:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 569 places, 502 transitions and 1573 arcs took 4 ms.
Total runtime 70894 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-20

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/416/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: 1308
MODEL NAME: /home/mcc/execution/416/model
569 places, 502 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.

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:
++ 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="BusinessProcesses-PT-20"
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-20, 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-171620398600602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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