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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9881.388 1624084.00 1652442.00 369.00 ????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-167813695900569.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-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900569
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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 159K 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-16-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678733784852

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:56:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:56:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:56:26] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-13 18:56:26] [INFO ] Transformed 638 places.
[2023-03-13 18:56:26] [INFO ] Transformed 578 transitions.
[2023-03-13 18:56:26] [INFO ] Found NUPN structural information;
[2023-03-13 18:56:26] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-16-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 134 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 627 transition count 570
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 63 place count 567 transition count 510
Iterating global reduction 1 with 60 rules applied. Total rules applied 123 place count 567 transition count 510
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 153 place count 537 transition count 480
Iterating global reduction 1 with 30 rules applied. Total rules applied 183 place count 537 transition count 480
Applied a total of 183 rules in 106 ms. Remains 537 /630 variables (removed 93) and now considering 480/570 (removed 90) transitions.
// Phase 1: matrix 480 rows 537 cols
[2023-03-13 18:56:26] [INFO ] Computed 97 place invariants in 24 ms
[2023-03-13 18:56:27] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-13 18:56:27] [INFO ] Invariant cache hit.
[2023-03-13 18:56:27] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2023-03-13 18:56:27] [INFO ] Invariant cache hit.
[2023-03-13 18:56:28] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/630 places, 480/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1438 ms. Remains : 537/630 places, 480/570 transitions.
Support contains 134 out of 537 places after structural reductions.
[2023-03-13 18:56:28] [INFO ] Flatten gal took : 56 ms
[2023-03-13 18:56:28] [INFO ] Flatten gal took : 32 ms
[2023-03-13 18:56:28] [INFO ] Input system was already deterministic with 480 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 83) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) 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 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) 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 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 46) 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 46) seen :0
Running SMT prover for 46 properties.
[2023-03-13 18:56:29] [INFO ] Invariant cache hit.
[2023-03-13 18:56:29] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:46
[2023-03-13 18:56:30] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-13 18:56:30] [INFO ] [Nat]Absence check using 59 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-13 18:56:31] [INFO ] After 949ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :43
[2023-03-13 18:56:31] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 11 ms to minimize.
[2023-03-13 18:56:31] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2023-03-13 18:56:31] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2023-03-13 18:56:31] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 0 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2023-03-13 18:56:32] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 0 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 0 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 5 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-13 18:56:33] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:56:34] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2023-03-13 18:56:34] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2023-03-13 18:56:34] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2784 ms
[2023-03-13 18:56:34] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2023-03-13 18:56:34] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 0 ms to minimize.
[2023-03-13 18:56:34] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2023-03-13 18:56:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 301 ms
[2023-03-13 18:56:34] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-03-13 18:56:35] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2023-03-13 18:56:35] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 3 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 0 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-13 18:56:35] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 1 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Deduced a trap composed of 113 places in 91 ms of which 0 ms to minimize.
[2023-03-13 18:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2023-03-13 18:56:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 358 ms
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 0 ms to minimize.
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2023-03-13 18:56:36] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 0 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 771 ms
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 111 places in 92 ms of which 0 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 1 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 0 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:56:37] [INFO ] Deduced a trap composed of 116 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:56:38] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 0 ms to minimize.
[2023-03-13 18:56:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 728 ms
[2023-03-13 18:56:38] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:56:38] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2023-03-13 18:56:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-13 18:56:38] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2023-03-13 18:56:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-13 18:56:38] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2023-03-13 18:56:38] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 685 ms
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 0 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-13 18:56:39] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 11 ms to minimize.
[2023-03-13 18:56:40] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:56:40] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:56:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 811 ms
[2023-03-13 18:56:40] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-13 18:56:40] [INFO ] After 10191ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :43
Attempting to minimize the solution found.
Minimization took 1048 ms.
[2023-03-13 18:56:41] [INFO ] After 11895ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :43
Fused 46 Parikh solutions to 43 different solutions.
Parikh walk visited 29 properties in 481 ms.
Support contains 24 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 480/480 transitions.
Graph (trivial) has 253 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1169 edges and 532 vertex of which 529 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 529 transition count 401
Reduce places removed 71 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 458 transition count 399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 148 place count 456 transition count 399
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 148 place count 456 transition count 308
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 345 place count 350 transition count 308
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 379 place count 316 transition count 274
Iterating global reduction 3 with 34 rules applied. Total rules applied 413 place count 316 transition count 274
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 413 place count 316 transition count 269
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 424 place count 310 transition count 269
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 637 place count 202 transition count 164
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 3 with 2 rules applied. Total rules applied 639 place count 201 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 641 place count 201 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 643 place count 199 transition count 166
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 647 place count 199 transition count 166
Applied a total of 647 rules in 143 ms. Remains 199 /537 variables (removed 338) and now considering 166/480 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 199/537 places, 166/480 transitions.
Incomplete random walk after 10000 steps, including 262 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 166 rows 199 cols
[2023-03-13 18:56:42] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-13 18:56:42] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:56:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 12 ms returned sat
[2023-03-13 18:56:42] [INFO ] [Nat]Absence check using 57 positive and 19 generalized place invariants in 3 ms returned sat
[2023-03-13 18:56:42] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:56:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 18:56:42] [INFO ] After 11ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:56:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-13 18:56:42] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2023-03-13 18:56:42] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2023-03-13 18:56:42] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2023-03-13 18:56:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2023-03-13 18:56:42] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-13 18:56:42] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 3 ms.
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 166/166 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 199 transition count 158
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 191 transition count 158
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 191 transition count 153
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 184 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 182 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 182 transition count 151
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 59 place count 168 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 61 place count 167 transition count 155
Applied a total of 61 rules in 24 ms. Remains 167 /199 variables (removed 32) and now considering 155/166 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 167/199 places, 155/166 transitions.
Incomplete random walk after 10000 steps, including 418 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished Best-First random walk after 4384 steps, including 84 resets, run visited all 1 properties in 8 ms. (steps per millisecond=548 )
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 26 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 480 transitions.
Computed a total of 152 stabilizing places and 143 stable transitions
Graph (complete) has 1176 edges and 537 vertex of which 534 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 ms
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 1 with 43 rules applied. Total rules applied 88 place count 492 transition count 437
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 103 place count 477 transition count 422
Iterating global reduction 1 with 15 rules applied. Total rules applied 118 place count 477 transition count 422
Applied a total of 118 rules in 56 ms. Remains 477 /537 variables (removed 60) and now considering 422/480 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 477/537 places, 422/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 15 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 46 place count 491 transition count 436
Iterating global reduction 1 with 44 rules applied. Total rules applied 90 place count 491 transition count 436
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 105 place count 476 transition count 421
Iterating global reduction 1 with 15 rules applied. Total rules applied 120 place count 476 transition count 421
Applied a total of 120 rules in 49 ms. Remains 476 /537 variables (removed 61) and now considering 421/480 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 476/537 places, 421/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 19 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 22 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 47 place count 490 transition count 435
Iterating global reduction 1 with 45 rules applied. Total rules applied 92 place count 490 transition count 435
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 108 place count 474 transition count 419
Iterating global reduction 1 with 16 rules applied. Total rules applied 124 place count 474 transition count 419
Applied a total of 124 rules in 49 ms. Remains 474 /537 variables (removed 63) and now considering 419/480 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 474/537 places, 419/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 28 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 48 place count 489 transition count 434
Iterating global reduction 1 with 46 rules applied. Total rules applied 94 place count 489 transition count 434
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 111 place count 472 transition count 417
Iterating global reduction 1 with 17 rules applied. Total rules applied 128 place count 472 transition count 417
Applied a total of 128 rules in 47 ms. Remains 472 /537 variables (removed 65) and now considering 417/480 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 472/537 places, 417/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 21 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Graph (trivial) has 276 edges and 537 vertex of which 6 / 537 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 1170 edges and 532 vertex of which 529 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 528 transition count 390
Reduce places removed 82 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 446 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 445 transition count 389
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 168 place count 445 transition count 292
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 378 place count 332 transition count 292
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 421 place count 289 transition count 249
Ensure Unique test removed 1 places
Iterating global reduction 3 with 44 rules applied. Total rules applied 465 place count 288 transition count 249
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 465 place count 288 transition count 244
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 476 place count 282 transition count 244
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 693 place count 172 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 694 place count 171 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 695 place count 170 transition count 136
Applied a total of 695 rules in 54 ms. Remains 170 /537 variables (removed 367) and now considering 136/480 (removed 344) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 170/537 places, 136/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 1 with 43 rules applied. Total rules applied 88 place count 492 transition count 437
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 104 place count 476 transition count 421
Iterating global reduction 1 with 16 rules applied. Total rules applied 120 place count 476 transition count 421
Applied a total of 120 rules in 46 ms. Remains 476 /537 variables (removed 61) and now considering 421/480 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 476/537 places, 421/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 43 place count 494 transition count 439
Iterating global reduction 1 with 41 rules applied. Total rules applied 84 place count 494 transition count 439
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 100 place count 478 transition count 423
Iterating global reduction 1 with 16 rules applied. Total rules applied 116 place count 478 transition count 423
Applied a total of 116 rules in 53 ms. Remains 478 /537 variables (removed 59) and now considering 423/480 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 478/537 places, 423/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Graph (trivial) has 276 edges and 537 vertex of which 6 / 537 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 1170 edges and 532 vertex of which 529 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 528 transition count 389
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 168 place count 445 transition count 389
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 168 place count 445 transition count 293
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 376 place count 333 transition count 293
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 419 place count 290 transition count 250
Ensure Unique test removed 1 places
Iterating global reduction 2 with 44 rules applied. Total rules applied 463 place count 289 transition count 250
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 463 place count 289 transition count 244
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 476 place count 282 transition count 244
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 693 place count 172 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 694 place count 171 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 695 place count 170 transition count 136
Applied a total of 695 rules in 44 ms. Remains 170 /537 variables (removed 367) and now considering 136/480 (removed 344) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 170/537 places, 136/480 transitions.
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:56:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:56:43] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 44 place count 493 transition count 438
Iterating global reduction 1 with 42 rules applied. Total rules applied 86 place count 493 transition count 438
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 100 place count 479 transition count 424
Iterating global reduction 1 with 14 rules applied. Total rules applied 114 place count 479 transition count 424
Applied a total of 114 rules in 47 ms. Remains 479 /537 variables (removed 58) and now considering 424/480 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 479/537 places, 424/480 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:44] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 497 transition count 442
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 497 transition count 442
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 93 place count 482 transition count 427
Iterating global reduction 1 with 15 rules applied. Total rules applied 108 place count 482 transition count 427
Applied a total of 108 rules in 45 ms. Remains 482 /537 variables (removed 55) and now considering 427/480 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 482/537 places, 427/480 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:44] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 495 transition count 438
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 495 transition count 438
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 482 transition count 425
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 482 transition count 425
Applied a total of 110 rules in 46 ms. Remains 482 /537 variables (removed 55) and now considering 425/480 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 482/537 places, 425/480 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:44] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Graph (trivial) has 276 edges and 537 vertex of which 6 / 537 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 1170 edges and 532 vertex of which 529 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 528 transition count 389
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 168 place count 445 transition count 389
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 168 place count 445 transition count 293
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 376 place count 333 transition count 293
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 420 place count 289 transition count 249
Ensure Unique test removed 1 places
Iterating global reduction 2 with 45 rules applied. Total rules applied 465 place count 288 transition count 249
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 465 place count 288 transition count 243
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 478 place count 281 transition count 243
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 2 with 209 rules applied. Total rules applied 687 place count 175 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 174 transition count 139
Applied a total of 688 rules in 36 ms. Remains 174 /537 variables (removed 363) and now considering 139/480 (removed 341) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 174/537 places, 139/480 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:56:44] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 497 transition count 442
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 497 transition count 442
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 92 place count 483 transition count 428
Iterating global reduction 1 with 14 rules applied. Total rules applied 106 place count 483 transition count 428
Applied a total of 106 rules in 23 ms. Remains 483 /537 variables (removed 54) and now considering 428/480 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 483/537 places, 428/480 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 49 place count 488 transition count 433
Iterating global reduction 1 with 47 rules applied. Total rules applied 96 place count 488 transition count 433
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 113 place count 471 transition count 416
Iterating global reduction 1 with 17 rules applied. Total rules applied 130 place count 471 transition count 416
Applied a total of 130 rules in 37 ms. Remains 471 /537 variables (removed 66) and now considering 416/480 (removed 64) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 471/537 places, 416/480 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 480/480 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 535 transition count 480
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 1 with 43 rules applied. Total rules applied 88 place count 492 transition count 437
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 104 place count 476 transition count 421
Iterating global reduction 1 with 16 rules applied. Total rules applied 120 place count 476 transition count 421
Applied a total of 120 rules in 30 ms. Remains 476 /537 variables (removed 61) and now considering 421/480 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 476/537 places, 421/480 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:56:44] [INFO ] Input system was already deterministic with 421 transitions.
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:56:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 18:56:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 537 places, 480 transitions and 1495 arcs took 2 ms.
Total runtime 18138 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 537 NrTr: 480 NrArc: 1495)

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

net check time: 0m 0.000sec

init dd package: 0m 2.970sec


before gc: list nodes free: 1015535

after gc: idd nodes used:58485016, unused:5514984; list nodes free:24394935

RS generation: 26m 2.385sec


-> last computed set: #nodes 58484889 (5.8e+07) #states 1,155,718,615,172 (12)


CANNOT_COMPUTE


BK_STOP 1678735408936

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-16"
export BK_EXAMINATION="CTLCardinality"
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-16, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695900569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;