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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716308084077

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:14:45] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-21 16:14:45] [INFO ] Transformed 717 places.
[2024-05-21 16:14:45] [INFO ] Transformed 642 transitions.
[2024-05-21 16:14:45] [INFO ] Found NUPN structural information;
[2024-05-21 16:14:45] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
Support contains 89 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 92 place count 610 transition count 543
Iterating global reduction 1 with 84 rules applied. Total rules applied 176 place count 610 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 177 place count 610 transition count 542
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 218 place count 569 transition count 501
Iterating global reduction 2 with 41 rules applied. Total rules applied 259 place count 569 transition count 501
Applied a total of 259 rules in 140 ms. Remains 569 /702 variables (removed 133) and now considering 501/627 (removed 126) transitions.
// Phase 1: matrix 501 rows 569 cols
[2024-05-21 16:14:46] [INFO ] Computed 106 invariants in 40 ms
[2024-05-21 16:14:46] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-21 16:14:46] [INFO ] Invariant cache hit.
[2024-05-21 16:14:46] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-21 16:14:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 120 places in 173 ms of which 33 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 4 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 3 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:14:58] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:14:58] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:14:58] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:15:02] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 5 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:15:03] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:15:04] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 4 ms to minimize.
[2024-05-21 16:15:04] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:15:04] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:15:04] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:15:04] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:15:04] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:15:05] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:15:05] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:15:05] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:15:05] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:15:05] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:15:05] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:15:05] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 4 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 5 ms to minimize.
[2024-05-21 16:15:07] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:07] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:15:07] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:15:07] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:15:07] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:15:07] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:15:08] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:15:09] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:15:09] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:15:09] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:15:09] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:15:09] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:15:10] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:15:10] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:15:10] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:15:10] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:15:10] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:15:14] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 4 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:15:15] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:15:16] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:15:16] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:15:16] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:15:16] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:15:16] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:15:16] [INFO ] Deduced a trap composed of 116 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:15:16] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:15:17] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:15:17] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
SMT process timed out in 30254ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 30285ms
Starting structural reductions in LTL mode, iteration 1 : 569/702 places, 501/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31396 ms. Remains : 569/702 places, 501/627 transitions.
Support contains 89 out of 569 places after structural reductions.
[2024-05-21 16:15:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 16:15:17] [INFO ] Flatten gal took : 82 ms
FORMULA BusinessProcesses-PT-18-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:15:17] [INFO ] Flatten gal took : 37 ms
[2024-05-21 16:15:17] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 81 out of 569 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (212 resets) in 2423 ms. (16 steps per ms) remains 27/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
[2024-05-21 16:15:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 218/257 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 177/434 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 119/553 variables, 39/104 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 2/555 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 492/1047 variables, 555/661 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1047 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 19/1066 variables, 10/671 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-21 16:15:20] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-05-21 16:15:20] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 4 ms to minimize.
[2024-05-21 16:15:20] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 4 ms to minimize.
[2024-05-21 16:15:20] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 4 ms to minimize.
[2024-05-21 16:15:21] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:15:21] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:15:21] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:15:21] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:15:21] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:15:21] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:15:21] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:15:22] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:15:22] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:15:22] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:15:22] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:15:22] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:15:22] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:15:23] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:15:23] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:15:23] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 20/691 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-21 16:15:23] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:15:23] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 3 ms to minimize.
SMT process timed out in 5053ms, After SMT, problems are : Problem set: 0 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 255 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 563 transition count 425
Reduce places removed 68 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 71 rules applied. Total rules applied 141 place count 495 transition count 422
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 144 place count 492 transition count 422
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 144 place count 492 transition count 319
Deduced a syphon composed of 103 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 367 place count 372 transition count 319
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 384 place count 355 transition count 302
Iterating global reduction 3 with 17 rules applied. Total rules applied 401 place count 355 transition count 302
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 653 place count 228 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 655 place count 227 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 656 place count 227 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 657 place count 226 transition count 179
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 661 place count 226 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 662 place count 225 transition count 178
Applied a total of 662 rules in 178 ms. Remains 225 /569 variables (removed 344) and now considering 178/501 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 225/569 places, 178/501 transitions.
RANDOM walk for 40000 steps (1432 resets) in 1145 ms. (34 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40002 steps (586 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (602 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (588 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
// Phase 1: matrix 178 rows 225 cols
[2024-05-21 16:15:24] [INFO ] Computed 87 invariants in 5 ms
[2024-05-21 16:15:24] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/106 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/109 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 40/149 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/150 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 172/322 variables, 150/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 78/400 variables, 72/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 25/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/402 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/403 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/403 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/403 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 317 constraints, problems are : Problem set: 0 solved, 3 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 225/225 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/106 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/109 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 7 (OVERLAPS) 40/149 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/150 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/322 variables, 150/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 5/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 2/211 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 78/400 variables, 72/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 25/308 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/402 variables, 8/316 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 2/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/403 variables, 1/319 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:15:25] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/403 variables, 1/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/403 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 320 constraints, problems are : Problem set: 1 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 225/225 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 644ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 3260 steps, including 80 resets, run visited all 2 properties in 37 ms. (steps per millisecond=88 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 49 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:15:25] [INFO ] Input system was already deterministic with 501 transitions.
Computed a total of 512 stabilizing places and 454 stable transitions
Graph (complete) has 1256 edges and 569 vertex of which 568 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 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 1249 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 414
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 483 transition count 414
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 160 place count 483 transition count 297
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 419 place count 341 transition count 297
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 445 place count 315 transition count 271
Ensure Unique test removed 1 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 472 place count 314 transition count 271
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 740 place count 179 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 742 place count 177 transition count 137
Applied a total of 742 rules in 50 ms. Remains 177 /569 variables (removed 392) and now considering 137/501 (removed 364) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 177/569 places, 137/501 transitions.
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:15:25] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 54 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 531/569 places, 463/501 transitions.
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 18 ms
[2024-05-21 16:15:25] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 537 transition count 469
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 536 transition count 468
Applied a total of 66 rules in 50 ms. Remains 536 /569 variables (removed 33) and now considering 468/501 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 536/569 places, 468/501 transitions.
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:15:25] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 536 transition count 468
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 44 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 535/569 places, 467/501 transitions.
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:15:25] [INFO ] Input system was already deterministic with 467 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 542 transition count 474
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 542 transition count 474
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 533 transition count 465
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 47 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 532/569 places, 464/501 transitions.
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:15:25] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 285 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 1249 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 562 transition count 416
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 485 transition count 416
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 156 place count 485 transition count 299
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 415 place count 343 transition count 299
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 440 place count 318 transition count 274
Ensure Unique test removed 1 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 466 place count 317 transition count 274
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 732 place count 183 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 733 place count 182 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 734 place count 181 transition count 141
Applied a total of 734 rules in 46 ms. Remains 181 /569 variables (removed 388) and now considering 141/501 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 181/569 places, 141/501 transitions.
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:15:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:15:25] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 538 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 36 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 538/569 places, 470/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 470
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 25 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 538/569 places, 470/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 538 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 33 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 538/569 places, 470/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 44 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 531/569 places, 463/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 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 1249 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 414
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 483 transition count 414
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 160 place count 483 transition count 298
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 417 place count 342 transition count 298
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 444 place count 315 transition count 271
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 472 place count 314 transition count 271
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 740 place count 179 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 742 place count 177 transition count 137
Applied a total of 742 rules in 36 ms. Remains 177 /569 variables (removed 392) and now considering 137/501 (removed 364) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 177/569 places, 137/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 5 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 8 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-18-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 536 transition count 468
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 38 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 535/569 places, 467/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 467 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 32 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 531/569 places, 463/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 30 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 531/569 places, 463/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 542 transition count 474
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 542 transition count 474
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 533 transition count 465
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 37 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 532/569 places, 464/501 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:15:26] [INFO ] Input system was already deterministic with 464 transitions.
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:15:26] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:15:26] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-21 16:15:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 569 places, 501 transitions and 1570 arcs took 4 ms.
Total runtime 41414 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-18

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 941
MODEL NAME: /home/mcc/execution/418/model
569 places, 501 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.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-18"
export BK_EXAMINATION="CTLCardinality"
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-18, examination is CTLCardinality"
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-171620398500585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;