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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 141K 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-11-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678731175433

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-11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:12:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:12:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:12:57] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-13 18:12:57] [INFO ] Transformed 567 places.
[2023-03-13 18:12:57] [INFO ] Transformed 508 transitions.
[2023-03-13 18:12:57] [INFO ] Found NUPN structural information;
[2023-03-13 18:12:57] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 7 transitions.
Support contains 110 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 58 place count 502 transition count 447
Iterating global reduction 1 with 54 rules applied. Total rules applied 112 place count 502 transition count 447
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 134 place count 480 transition count 425
Iterating global reduction 1 with 22 rules applied. Total rules applied 156 place count 480 transition count 425
Applied a total of 156 rules in 101 ms. Remains 480 /560 variables (removed 80) and now considering 425/501 (removed 76) transitions.
// Phase 1: matrix 425 rows 480 cols
[2023-03-13 18:12:57] [INFO ] Computed 91 place invariants in 32 ms
[2023-03-13 18:12:57] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-13 18:12:57] [INFO ] Invariant cache hit.
[2023-03-13 18:12:58] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-03-13 18:12:58] [INFO ] Invariant cache hit.
[2023-03-13 18:12:58] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 480/560 places, 425/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1236 ms. Remains : 480/560 places, 425/501 transitions.
Support contains 110 out of 480 places after structural reductions.
[2023-03-13 18:12:58] [INFO ] Flatten gal took : 59 ms
[2023-03-13 18:12:58] [INFO ] Flatten gal took : 28 ms
[2023-03-13 18:12:58] [INFO ] Input system was already deterministic with 425 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 79) seen :25
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Running SMT prover for 54 properties.
[2023-03-13 18:12:59] [INFO ] Invariant cache hit.
[2023-03-13 18:13:00] [INFO ] [Real]Absence check using 49 positive place invariants in 15 ms returned sat
[2023-03-13 18:13:00] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 15 ms returned sat
[2023-03-13 18:13:00] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:53
[2023-03-13 18:13:00] [INFO ] [Nat]Absence check using 49 positive place invariants in 12 ms returned sat
[2023-03-13 18:13:00] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-13 18:13:02] [INFO ] After 855ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :45
[2023-03-13 18:13:02] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 7 ms to minimize.
[2023-03-13 18:13:02] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-13 18:13:02] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2023-03-13 18:13:02] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:13:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 611 ms
[2023-03-13 18:13:02] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2023-03-13 18:13:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-13 18:13:02] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:13:03] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 1 ms to minimize.
[2023-03-13 18:13:03] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 1 ms to minimize.
[2023-03-13 18:13:03] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 1 ms to minimize.
[2023-03-13 18:13:03] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 6 ms to minimize.
[2023-03-13 18:13:03] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:13:03] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 0 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 0 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 1 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 0 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 0 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 0 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 1 ms to minimize.
[2023-03-13 18:13:04] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 1 ms to minimize.
[2023-03-13 18:13:05] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:13:05] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 1 ms to minimize.
[2023-03-13 18:13:05] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 0 ms to minimize.
[2023-03-13 18:13:05] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2023-03-13 18:13:05] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:13:05] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:13:05] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 0 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3285 ms
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 107 places in 86 ms of which 2 ms to minimize.
[2023-03-13 18:13:06] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 4 ms to minimize.
[2023-03-13 18:13:07] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:13:07] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 0 ms to minimize.
[2023-03-13 18:13:07] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 1 ms to minimize.
[2023-03-13 18:13:07] [INFO ] Deduced a trap composed of 110 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:13:07] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 1 ms to minimize.
[2023-03-13 18:13:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 832 ms
[2023-03-13 18:13:07] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:13:07] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-13 18:13:08] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:13:08] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 0 ms to minimize.
[2023-03-13 18:13:08] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:13:08] [INFO ] Deduced a trap composed of 118 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:13:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 818 ms
[2023-03-13 18:13:08] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2023-03-13 18:13:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-13 18:13:08] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2023-03-13 18:13:09] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:13:09] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2023-03-13 18:13:09] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:13:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 435 ms
[2023-03-13 18:13:09] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:13:09] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:13:10] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2023-03-13 18:13:10] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 1 ms to minimize.
[2023-03-13 18:13:10] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 1 ms to minimize.
[2023-03-13 18:13:10] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 8 ms to minimize.
[2023-03-13 18:13:10] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:13:10] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:13:11] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:13:11] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 1 ms to minimize.
[2023-03-13 18:13:11] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:13:11] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:13:11] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:13:11] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 0 ms to minimize.
[2023-03-13 18:13:12] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:13:12] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 0 ms to minimize.
[2023-03-13 18:13:12] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 1 ms to minimize.
[2023-03-13 18:13:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2666 ms
[2023-03-13 18:13:12] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 1 ms to minimize.
[2023-03-13 18:13:12] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 1 ms to minimize.
[2023-03-13 18:13:13] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 0 ms to minimize.
[2023-03-13 18:13:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 468 ms
[2023-03-13 18:13:13] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:13:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-13 18:13:13] [INFO ] After 12256ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :45
Attempting to minimize the solution found.
Minimization took 1422 ms.
[2023-03-13 18:13:14] [INFO ] After 14427ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :45
Fused 54 Parikh solutions to 45 different solutions.
Parikh walk visited 0 properties in 715 ms.
Support contains 69 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 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
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 479 transition count 389
Reduce places removed 35 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 444 transition count 385
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 440 transition count 385
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 79 place count 440 transition count 304
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 253 place count 347 transition count 304
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 261 place count 339 transition count 296
Iterating global reduction 3 with 8 rules applied. Total rules applied 269 place count 339 transition count 296
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 460 place count 243 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 461 place count 243 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 463 place count 242 transition count 204
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 472 place count 242 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 473 place count 241 transition count 203
Applied a total of 473 rules in 84 ms. Remains 241 /480 variables (removed 239) and now considering 203/425 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 241/480 places, 203/425 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 45) seen :2
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Interrupted probabilistic random walk after 838035 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :{0=1, 1=1, 2=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1}
Probabilistic random walk after 838035 steps, saw 130663 distinct states, run finished after 3002 ms. (steps per millisecond=279 ) properties seen :38
Running SMT prover for 5 properties.
// Phase 1: matrix 203 rows 241 cols
[2023-03-13 18:13:19] [INFO ] Computed 78 place invariants in 5 ms
[2023-03-13 18:13:19] [INFO ] [Real]Absence check using 52 positive place invariants in 12 ms returned sat
[2023-03-13 18:13:19] [INFO ] [Real]Absence check using 52 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-13 18:13:19] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-13 18:13:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:13:19] [INFO ] After 32ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 18:13:19] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 18:13:19] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2023-03-13 18:13:19] [INFO ] [Nat]Absence check using 52 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-13 18:13:19] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 18:13:19] [INFO ] After 30ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 18:13:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 18:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-13 18:13:19] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2023-03-13 18:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-13 18:13:19] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-13 18:13:19] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 15 ms.
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 203/203 transitions.
Graph (trivial) has 58 edges and 241 vertex of which 2 / 241 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 240 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 226 transition count 187
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 29 place count 226 transition count 168
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 73 place count 201 transition count 168
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 192 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 192 transition count 159
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 136 place count 168 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 168 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 166 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 166 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 165 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 165 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 164 transition count 134
Applied a total of 144 rules in 47 ms. Remains 164 /241 variables (removed 77) and now considering 134/203 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 164/241 places, 134/203 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Finished probabilistic random walk after 15289 steps, run visited all 5 properties in 85 ms. (steps per millisecond=179 )
Probabilistic random walk after 15289 steps, saw 4668 distinct states, run finished after 86 ms. (steps per millisecond=177 ) properties seen :5
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-11-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 21 ms
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 22 ms
[2023-03-13 18:13:20] [INFO ] Input system was already deterministic with 425 transitions.
Support contains 93 out of 480 places (down from 94) after GAL structural reductions.
Computed a total of 465 stabilizing places and 410 stable transitions
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 453 transition count 398
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 453 transition count 398
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 440 transition count 385
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 440 transition count 385
Applied a total of 80 rules in 26 ms. Remains 440 /480 variables (removed 40) and now considering 385/425 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 440/480 places, 385/425 transitions.
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:13:20] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 459 transition count 404
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 459 transition count 404
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 448 transition count 393
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 448 transition count 393
Applied a total of 64 rules in 39 ms. Remains 448 /480 variables (removed 32) and now considering 393/425 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 448/480 places, 393/425 transitions.
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:13:20] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 456 transition count 401
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 456 transition count 401
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 444 transition count 389
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 46 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:13:20] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 228 edges and 480 vertex of which 4 / 480 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 475 transition count 355
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 410 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 409 transition count 354
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 134 place count 409 transition count 265
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 328 place count 304 transition count 265
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 352 place count 280 transition count 241
Iterating global reduction 3 with 24 rules applied. Total rules applied 376 place count 280 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 376 place count 280 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 380 place count 278 transition count 239
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 585 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 586 place count 174 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 173 transition count 136
Applied a total of 587 rules in 58 ms. Remains 173 /480 variables (removed 307) and now considering 136/425 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 173/480 places, 136/425 transitions.
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:13:20] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 473 transition count 351
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 407 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 136 place count 406 transition count 256
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 342 place count 294 transition count 256
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 368 place count 268 transition count 230
Iterating global reduction 3 with 26 rules applied. Total rules applied 394 place count 268 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 394 place count 268 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 398 place count 266 transition count 228
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 47 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 157/480 places, 123/425 transitions.
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:13:20] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 226 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 473 transition count 358
Reduce places removed 59 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 414 transition count 355
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 411 transition count 355
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 126 place count 411 transition count 264
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 324 place count 304 transition count 264
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 349 place count 279 transition count 239
Iterating global reduction 3 with 25 rules applied. Total rules applied 374 place count 279 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 374 place count 279 transition count 237
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 378 place count 277 transition count 237
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 587 place count 171 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 588 place count 170 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 589 place count 169 transition count 133
Applied a total of 589 rules in 43 ms. Remains 169 /480 variables (removed 311) and now considering 133/425 (removed 292) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 169/480 places, 133/425 transitions.
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:13:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:13:20] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 455 transition count 400
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 455 transition count 400
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 444 transition count 389
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 21 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 233 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 473 transition count 352
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 408 transition count 352
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 132 place count 408 transition count 257
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 365 place count 270 transition count 232
Iterating global reduction 2 with 25 rules applied. Total rules applied 390 place count 270 transition count 232
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 270 transition count 231
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 269 transition count 231
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 201 rules applied. Total rules applied 593 place count 167 transition count 132
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 599 place count 167 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 600 place count 166 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 601 place count 165 transition count 131
Applied a total of 601 rules in 40 ms. Remains 165 /480 variables (removed 315) and now considering 131/425 (removed 294) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 165/480 places, 131/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 20 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 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 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 473 transition count 350
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 136 place count 406 transition count 257
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 366 place count 269 transition count 231
Iterating global reduction 2 with 26 rules applied. Total rules applied 392 place count 269 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 392 place count 269 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 396 place count 267 transition count 229
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 34 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 157/480 places, 123/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 230 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 473 transition count 353
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 409 transition count 353
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 130 place count 409 transition count 261
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 330 place count 301 transition count 261
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 355 place count 276 transition count 236
Iterating global reduction 2 with 25 rules applied. Total rules applied 380 place count 276 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 380 place count 276 transition count 235
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 382 place count 275 transition count 235
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 589 place count 170 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 590 place count 169 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 591 place count 168 transition count 132
Applied a total of 591 rules in 40 ms. Remains 168 /480 variables (removed 312) and now considering 132/425 (removed 293) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 168/480 places, 132/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 454 transition count 399
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 454 transition count 399
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 441 transition count 386
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 441 transition count 386
Applied a total of 78 rules in 22 ms. Remains 441 /480 variables (removed 39) and now considering 386/425 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 441/480 places, 386/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 478 transition count 374
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 429 transition count 371
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 426 transition count 371
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 105 place count 426 transition count 263
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 339 place count 300 transition count 263
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 362 place count 277 transition count 240
Iterating global reduction 3 with 23 rules applied. Total rules applied 385 place count 277 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 385 place count 277 transition count 239
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 387 place count 276 transition count 239
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 596 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 602 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 604 place count 168 transition count 135
Applied a total of 604 rules in 41 ms. Remains 168 /480 variables (removed 312) and now considering 135/425 (removed 290) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 168/480 places, 135/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 22 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 24 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:13:21] [INFO ] Input system was already deterministic with 383 transitions.
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:13:21] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:13:21] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 18:13:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 425 transitions and 1342 arcs took 2 ms.
Total runtime 24623 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: 480 NrTr: 425 NrArc: 1342)

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

net check time: 0m 0.000sec

init dd package: 0m 3.309sec


before gc: list nodes free: 114378

after gc: idd nodes used:47704494, unused:16295506; list nodes free:68206931

before gc: list nodes free: 782302

after gc: idd nodes used:55962030, unused:8037970; list nodes free:34718035

before gc: list nodes free: 114865

after gc: idd nodes used:58190254, unused:5809746; list nodes free:24953171

before gc: list nodes free: 1967327

after gc: idd nodes used:58321326, unused:5678674; list nodes free:25674067

before gc: list nodes free: 1060210

after gc: idd nodes used:59042222, unused:4957778; list nodes free:21938515

RS generation: 24m14.411sec


-> last computed set: #nodes 59042138 (5.9e+07) #states 12,127,217,885 (10)


CANNOT_COMPUTE


BK_STOP 1678732696762

--------------------
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.002sec

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-11"
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-11, 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-167813695900530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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