fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813695900578
Last Updated
May 14, 2023

About the Execution of Marcie+red for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9812.907 1097463.00 1124984.00 236.20 ?????F?T?????T?F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 161K Mar 5 18:22 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-17-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678734299549

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:05:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:05:01] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-13 19:05:01] [INFO ] Transformed 650 places.
[2023-03-13 19:05:01] [INFO ] Transformed 580 transitions.
[2023-03-13 19:05:01] [INFO ] Found NUPN structural information;
[2023-03-13 19:05:01] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 6 ms.
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 4 transitions.
Support contains 78 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 85 place count 561 transition count 494
Iterating global reduction 1 with 82 rules applied. Total rules applied 167 place count 561 transition count 494
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 202 place count 526 transition count 459
Iterating global reduction 1 with 35 rules applied. Total rules applied 237 place count 526 transition count 459
Applied a total of 237 rules in 98 ms. Remains 526 /646 variables (removed 120) and now considering 459/576 (removed 117) transitions.
// Phase 1: matrix 459 rows 526 cols
[2023-03-13 19:05:01] [INFO ] Computed 105 place invariants in 39 ms
[2023-03-13 19:05:02] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-13 19:05:02] [INFO ] Invariant cache hit.
[2023-03-13 19:05:02] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2023-03-13 19:05:02] [INFO ] Invariant cache hit.
[2023-03-13 19:05:02] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/646 places, 459/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1358 ms. Remains : 526/646 places, 459/576 transitions.
Support contains 78 out of 526 places after structural reductions.
[2023-03-13 19:05:02] [INFO ] Flatten gal took : 62 ms
[2023-03-13 19:05:03] [INFO ] Flatten gal took : 29 ms
[2023-03-13 19:05:03] [INFO ] Input system was already deterministic with 459 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 54) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
[2023-03-13 19:05:03] [INFO ] Invariant cache hit.
[2023-03-13 19:05:04] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:36
[2023-03-13 19:05:04] [INFO ] [Nat]Absence check using 61 positive place invariants in 14 ms returned sat
[2023-03-13 19:05:04] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 9 ms returned sat
[2023-03-13 19:05:05] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :32
[2023-03-13 19:05:05] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 5 ms to minimize.
[2023-03-13 19:05:05] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2023-03-13 19:05:06] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:05:06] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2023-03-13 19:05:06] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 0 ms to minimize.
[2023-03-13 19:05:06] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:05:06] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2023-03-13 19:05:06] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2023-03-13 19:05:07] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 0 ms to minimize.
[2023-03-13 19:05:07] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-13 19:05:07] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 1 ms to minimize.
[2023-03-13 19:05:07] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 0 ms to minimize.
[2023-03-13 19:05:07] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 0 ms to minimize.
[2023-03-13 19:05:07] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2023-03-13 19:05:08] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 1 ms to minimize.
[2023-03-13 19:05:08] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:05:08] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2023-03-13 19:05:08] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 1 ms to minimize.
[2023-03-13 19:05:08] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 0 ms to minimize.
[2023-03-13 19:05:08] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 1 ms to minimize.
[2023-03-13 19:05:09] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2023-03-13 19:05:09] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2023-03-13 19:05:09] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:05:09] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2023-03-13 19:05:09] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2023-03-13 19:05:10] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:05:10] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 0 ms to minimize.
[2023-03-13 19:05:10] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 1 ms to minimize.
[2023-03-13 19:05:10] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 0 ms to minimize.
[2023-03-13 19:05:10] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:05:10] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:05:10] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 0 ms to minimize.
[2023-03-13 19:05:11] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 1 ms to minimize.
[2023-03-13 19:05:11] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 0 ms to minimize.
[2023-03-13 19:05:11] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5922 ms
[2023-03-13 19:05:11] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 1 ms to minimize.
[2023-03-13 19:05:11] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 0 ms to minimize.
[2023-03-13 19:05:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2023-03-13 19:05:12] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2023-03-13 19:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-13 19:05:12] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 6 ms to minimize.
[2023-03-13 19:05:12] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-13 19:05:12] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-03-13 19:05:12] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 0 ms to minimize.
[2023-03-13 19:05:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 431 ms
[2023-03-13 19:05:12] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2023-03-13 19:05:12] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2023-03-13 19:05:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-13 19:05:13] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 1 ms to minimize.
[2023-03-13 19:05:13] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 0 ms to minimize.
[2023-03-13 19:05:13] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:05:13] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 1 ms to minimize.
[2023-03-13 19:05:13] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 1 ms to minimize.
[2023-03-13 19:05:13] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2023-03-13 19:05:14] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2023-03-13 19:05:14] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2023-03-13 19:05:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1259 ms
[2023-03-13 19:05:14] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 1 ms to minimize.
[2023-03-13 19:05:14] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 0 ms to minimize.
[2023-03-13 19:05:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2023-03-13 19:05:15] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-13 19:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-13 19:05:15] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2023-03-13 19:05:15] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 0 ms to minimize.
[2023-03-13 19:05:15] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:05:16] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:05:16] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 1 ms to minimize.
[2023-03-13 19:05:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 902 ms
[2023-03-13 19:05:16] [INFO ] After 11902ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :32
Attempting to minimize the solution found.
Minimization took 983 ms.
[2023-03-13 19:05:17] [INFO ] After 13358ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :32
Fused 36 Parikh solutions to 32 different solutions.
Parikh walk visited 6 properties in 649 ms.
Support contains 37 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 459/459 transitions.
Graph (complete) has 1169 edges and 526 vertex of which 525 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 525 transition count 407
Reduce places removed 51 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 474 transition count 403
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 470 transition count 403
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 111 place count 470 transition count 309
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 314 place count 361 transition count 309
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 322 place count 353 transition count 301
Iterating global reduction 3 with 8 rules applied. Total rules applied 330 place count 353 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 353 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 352 transition count 300
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 589 place count 221 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 590 place count 221 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 591 place count 221 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 592 place count 220 transition count 172
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 601 place count 220 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 219 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 603 place count 218 transition count 171
Applied a total of 603 rules in 164 ms. Remains 218 /526 variables (removed 308) and now considering 171/459 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 218/526 places, 171/459 transitions.
Incomplete random walk after 10000 steps, including 719 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Probabilistic random walk after 1000000 steps, saw 180622 distinct states, run finished after 2450 ms. (steps per millisecond=408 ) properties seen :25
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 218 cols
[2023-03-13 19:05:21] [INFO ] Computed 84 place invariants in 9 ms
[2023-03-13 19:05:21] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-13 19:05:21] [INFO ] [Real]Absence check using 58 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-13 19:05:21] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 19:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 19:05:21] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:05:21] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:05:21] [INFO ] [Nat]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-13 19:05:21] [INFO ] [Nat]Absence check using 58 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-13 19:05:21] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:05:21] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:05:21] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2023-03-13 19:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-13 19:05:21] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-13 19:05:21] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 171/171 transitions.
Graph (trivial) has 35 edges and 218 vertex of which 2 / 218 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 217 transition count 163
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 211 transition count 163
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 13 place count 211 transition count 151
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 42 place count 194 transition count 151
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 189 transition count 146
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 189 transition count 146
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 76 place count 177 transition count 134
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 177 transition count 131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 174 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 172 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 171 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 171 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 170 transition count 128
Applied a total of 87 rules in 62 ms. Remains 170 /218 variables (removed 48) and now considering 128/171 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 170/218 places, 128/171 transitions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Probably explored full state space saw : 2058 states, properties seen :0
Probabilistic random walk after 7031 steps, saw 2058 distinct states, run finished after 27 ms. (steps per millisecond=260 ) properties seen :0
Explored full state space saw : 2058 states, properties seen :0
Exhaustive walk after 7031 steps, saw 2058 distinct states, run finished after 22 ms. (steps per millisecond=319 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-13 19:05:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 31 ms
FORMULA BusinessProcesses-PT-17-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 31 ms
[2023-03-13 19:05:22] [INFO ] Input system was already deterministic with 459 transitions.
Support contains 58 out of 526 places (down from 65) after GAL structural reductions.
Computed a total of 218 stabilizing places and 190 stable transitions
Graph (complete) has 1169 edges and 526 vertex of which 525 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 509 transition count 442
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 509 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 503 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 503 transition count 436
Applied a total of 46 rules in 65 ms. Remains 503 /526 variables (removed 23) and now considering 436/459 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 503/526 places, 436/459 transitions.
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 23 ms
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 24 ms
[2023-03-13 19:05:22] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 508 transition count 441
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 508 transition count 441
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 501 transition count 434
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 501 transition count 434
Applied a total of 50 rules in 49 ms. Remains 501 /526 variables (removed 25) and now considering 434/459 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 501/526 places, 434/459 transitions.
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 23 ms
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 23 ms
[2023-03-13 19:05:22] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 508 transition count 441
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 508 transition count 441
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 501 transition count 434
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 501 transition count 434
Applied a total of 50 rules in 37 ms. Remains 501 /526 variables (removed 25) and now considering 434/459 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 501/526 places, 434/459 transitions.
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 19 ms
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 20 ms
[2023-03-13 19:05:22] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 511 transition count 444
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 511 transition count 444
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 505 transition count 438
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 505 transition count 438
Applied a total of 42 rules in 34 ms. Remains 505 /526 variables (removed 21) and now considering 438/459 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 505/526 places, 438/459 transitions.
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 16 ms
[2023-03-13 19:05:22] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 510 transition count 443
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 510 transition count 443
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 504 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 504 transition count 437
Applied a total of 44 rules in 27 ms. Remains 504 /526 variables (removed 22) and now considering 437/459 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 504/526 places, 437/459 transitions.
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:05:22] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 509 transition count 442
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 509 transition count 442
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 502 transition count 435
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 502 transition count 435
Applied a total of 48 rules in 29 ms. Remains 502 /526 variables (removed 24) and now considering 435/459 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 502/526 places, 435/459 transitions.
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:05:22] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:05:22] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Graph (trivial) has 252 edges and 526 vertex of which 7 / 526 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1162 edges and 520 vertex of which 519 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 removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 518 transition count 389
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 457 transition count 389
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 124 place count 457 transition count 283
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 356 place count 331 transition count 283
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 373 place count 314 transition count 266
Iterating global reduction 2 with 17 rules applied. Total rules applied 390 place count 314 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 390 place count 314 transition count 265
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 392 place count 313 transition count 265
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 5 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 657 place count 178 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 658 place count 177 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 659 place count 176 transition count 134
Applied a total of 659 rules in 52 ms. Remains 176 /526 variables (removed 350) and now considering 134/459 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 176/526 places, 134/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 134 transitions.
Incomplete random walk after 10000 steps, including 2086 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 589 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69 steps, run visited all 1 properties in 4 ms. (steps per millisecond=17 )
Probabilistic random walk after 69 steps, saw 44 distinct states, run finished after 4 ms. (steps per millisecond=17 ) properties seen :1
FORMULA BusinessProcesses-PT-17-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 509 transition count 442
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 509 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 503 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 503 transition count 436
Applied a total of 46 rules in 24 ms. Remains 503 /526 variables (removed 23) and now considering 436/459 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 503/526 places, 436/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Graph (trivial) has 252 edges and 526 vertex of which 7 / 526 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1162 edges and 520 vertex of which 519 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 removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 518 transition count 390
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 458 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 457 transition count 389
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 124 place count 457 transition count 282
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 358 place count 330 transition count 282
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 375 place count 313 transition count 265
Iterating global reduction 3 with 17 rules applied. Total rules applied 392 place count 313 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 392 place count 313 transition count 264
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 394 place count 312 transition count 264
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 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 263 rules applied. Total rules applied 657 place count 178 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 658 place count 177 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 659 place count 176 transition count 134
Applied a total of 659 rules in 45 ms. Remains 176 /526 variables (removed 350) and now considering 134/459 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 176/526 places, 134/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 508 transition count 441
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 508 transition count 441
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 501 transition count 434
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 501 transition count 434
Applied a total of 50 rules in 23 ms. Remains 501 /526 variables (removed 25) and now considering 434/459 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 501/526 places, 434/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Graph (complete) has 1169 edges and 526 vertex of which 525 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 524 transition count 405
Reduce places removed 52 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 56 rules applied. Total rules applied 109 place count 472 transition count 401
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 468 transition count 401
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 113 place count 468 transition count 290
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 353 place count 339 transition count 290
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 370 place count 322 transition count 273
Iterating global reduction 3 with 17 rules applied. Total rules applied 387 place count 322 transition count 273
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 5 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 648 place count 189 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 649 place count 188 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 650 place count 187 transition count 144
Applied a total of 650 rules in 36 ms. Remains 187 /526 variables (removed 339) and now considering 144/459 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 187/526 places, 144/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 510 transition count 443
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 510 transition count 443
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 504 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 504 transition count 437
Applied a total of 44 rules in 23 ms. Remains 504 /526 variables (removed 22) and now considering 437/459 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 504/526 places, 437/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Graph (trivial) has 251 edges and 526 vertex of which 7 / 526 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1162 edges and 520 vertex of which 519 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 518 transition count 390
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 458 transition count 390
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 122 place count 458 transition count 284
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 354 place count 332 transition count 284
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 370 place count 316 transition count 268
Iterating global reduction 2 with 16 rules applied. Total rules applied 386 place count 316 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 386 place count 316 transition count 267
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 315 transition count 267
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 655 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 656 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 657 place count 177 transition count 135
Applied a total of 657 rules in 34 ms. Remains 177 /526 variables (removed 349) and now considering 135/459 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 177/526 places, 135/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 135 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA BusinessProcesses-PT-17-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Graph (complete) has 1169 edges and 526 vertex of which 525 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 524 transition count 403
Reduce places removed 54 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 111 place count 470 transition count 401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 468 transition count 401
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 113 place count 468 transition count 291
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 352 place count 339 transition count 291
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 368 place count 323 transition count 275
Iterating global reduction 3 with 16 rules applied. Total rules applied 384 place count 323 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 384 place count 323 transition count 274
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 386 place count 322 transition count 274
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 645 place count 190 transition count 147
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 190 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 189 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 188 transition count 146
Applied a total of 648 rules in 42 ms. Remains 188 /526 variables (removed 338) and now considering 146/459 (removed 313) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 188/526 places, 146/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 526/526 places, 459/459 transitions.
Graph (trivial) has 252 edges and 526 vertex of which 7 / 526 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1162 edges and 520 vertex of which 519 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 518 transition count 389
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 457 transition count 389
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 124 place count 457 transition count 283
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 356 place count 331 transition count 283
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 373 place count 314 transition count 266
Iterating global reduction 2 with 17 rules applied. Total rules applied 390 place count 314 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 390 place count 314 transition count 265
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 313 transition count 265
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 5 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 653 place count 180 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 654 place count 179 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 655 place count 178 transition count 136
Applied a total of 655 rules in 36 ms. Remains 178 /526 variables (removed 348) and now considering 136/459 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 178/526 places, 136/459 transitions.
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:05:23] [INFO ] Input system was already deterministic with 136 transitions.
Incomplete random walk after 10000 steps, including 1707 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 422 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 545 steps, run visited all 1 properties in 5 ms. (steps per millisecond=109 )
Probabilistic random walk after 545 steps, saw 271 distinct states, run finished after 6 ms. (steps per millisecond=90 ) properties seen :1
FORMULA BusinessProcesses-PT-17-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:05:23] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:05:23] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 19:05:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 526 places, 459 transitions and 1464 arcs took 2 ms.
Total runtime 22514 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 526 NrTr: 459 NrArc: 1464)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.015sec

net check time: 0m 0.000sec

init dd package: 0m 3.060sec


before gc: list nodes free: 295822

after gc: idd nodes used:36178621, unused:27821379; list nodes free:115057618

RS generation: 17m28.679sec


-> last computed set: #nodes 36178536 (3.6e+07) #states 1,883,756,975 (9)


CANNOT_COMPUTE


BK_STOP 1678735397012

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

idd.cc:820: DD Exception: No free nodes

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-17"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is BusinessProcesses-PT-17, 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 r042-tajo-167813695900578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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