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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9813.376 3007775.00 3049298.00 370.90 T??T?F??????T??? 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-167813695900577.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900577
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 161K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678734272917

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-17
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:04:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:04:34] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-13 19:04:34] [INFO ] Transformed 650 places.
[2023-03-13 19:04:34] [INFO ] Transformed 580 transitions.
[2023-03-13 19:04:34] [INFO ] Found NUPN structural information;
[2023-03-13 19:04:34] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Support contains 127 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 644 transition count 576
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 73 place count 573 transition count 505
Iterating global reduction 1 with 71 rules applied. Total rules applied 144 place count 573 transition count 505
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 174 place count 543 transition count 475
Iterating global reduction 1 with 30 rules applied. Total rules applied 204 place count 543 transition count 475
Applied a total of 204 rules in 129 ms. Remains 543 /646 variables (removed 103) and now considering 475/576 (removed 101) transitions.
// Phase 1: matrix 475 rows 543 cols
[2023-03-13 19:04:35] [INFO ] Computed 106 place invariants in 62 ms
[2023-03-13 19:04:35] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-13 19:04:35] [INFO ] Invariant cache hit.
[2023-03-13 19:04:36] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-03-13 19:04:36] [INFO ] Invariant cache hit.
[2023-03-13 19:04:36] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 543/646 places, 475/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1489 ms. Remains : 543/646 places, 475/576 transitions.
Support contains 127 out of 543 places after structural reductions.
[2023-03-13 19:04:36] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-13 19:04:36] [INFO ] Flatten gal took : 95 ms
[2023-03-13 19:04:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-17-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:04:36] [INFO ] Flatten gal took : 58 ms
[2023-03-13 19:04:36] [INFO ] Input system was already deterministic with 475 transitions.
Support contains 111 out of 543 places (down from 127) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 70) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) 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 37) 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 37) 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 37) 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 37) 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 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) seen :0
Running SMT prover for 37 properties.
[2023-03-13 19:04:37] [INFO ] Invariant cache hit.
[2023-03-13 19:04:38] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-13 19:04:38] [INFO ] [Real]Absence check using 63 positive and 43 generalized place invariants in 7 ms returned sat
[2023-03-13 19:04:38] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2023-03-13 19:04:38] [INFO ] [Nat]Absence check using 63 positive place invariants in 20 ms returned sat
[2023-03-13 19:04:38] [INFO ] [Nat]Absence check using 63 positive and 43 generalized place invariants in 65 ms returned sat
[2023-03-13 19:04:39] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :36
[2023-03-13 19:04:39] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 15 ms to minimize.
[2023-03-13 19:04:39] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-13 19:04:39] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 15 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 0 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-13 19:04:40] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2023-03-13 19:04:41] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2023-03-13 19:04:41] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2023-03-13 19:04:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1535 ms
[2023-03-13 19:04:41] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2023-03-13 19:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-13 19:04:41] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:04:41] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:04:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-13 19:04:42] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 3 ms to minimize.
[2023-03-13 19:04:42] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 0 ms to minimize.
[2023-03-13 19:04:42] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 0 ms to minimize.
[2023-03-13 19:04:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 488 ms
[2023-03-13 19:04:42] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 1 ms to minimize.
[2023-03-13 19:04:42] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:04:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-03-13 19:04:43] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:04:43] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 1 ms to minimize.
[2023-03-13 19:04:43] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 1 ms to minimize.
[2023-03-13 19:04:43] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 1 ms to minimize.
[2023-03-13 19:04:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 623 ms
[2023-03-13 19:04:43] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-13 19:04:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-13 19:04:44] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 0 ms to minimize.
[2023-03-13 19:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-13 19:04:44] [INFO ] After 5369ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :36
Attempting to minimize the solution found.
Minimization took 1082 ms.
[2023-03-13 19:04:45] [INFO ] After 7275ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :36
Fused 37 Parikh solutions to 35 different solutions.
Parikh walk visited 0 properties in 792 ms.
Support contains 57 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 475/475 transitions.
Graph (trivial) has 215 edges and 543 vertex of which 4 / 543 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1195 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 538 transition count 420
Reduce places removed 50 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 58 rules applied. Total rules applied 110 place count 488 transition count 412
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 118 place count 480 transition count 412
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 118 place count 480 transition count 329
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 296 place count 385 transition count 329
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 311 place count 370 transition count 314
Iterating global reduction 3 with 15 rules applied. Total rules applied 326 place count 370 transition count 314
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 560 place count 253 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 562 place count 252 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 252 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 564 place count 251 transition count 200
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 567 place count 251 transition count 200
Applied a total of 567 rules in 116 ms. Remains 251 /543 variables (removed 292) and now considering 200/475 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 251/543 places, 200/475 transitions.
Incomplete random walk after 10000 steps, including 402 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 36) seen :16
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 200 rows 251 cols
[2023-03-13 19:04:46] [INFO ] Computed 93 place invariants in 7 ms
[2023-03-13 19:04:46] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-13 19:04:46] [INFO ] [Real]Absence check using 58 positive and 35 generalized place invariants in 8 ms returned sat
[2023-03-13 19:04:46] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 19:04:46] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 19:04:46] [INFO ] [Nat]Absence check using 58 positive and 35 generalized place invariants in 11 ms returned sat
[2023-03-13 19:04:47] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-13 19:04:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 19:04:47] [INFO ] After 142ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 152 ms
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 0 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-13 19:04:47] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-13 19:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-13 19:04:47] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-13 19:04:48] [INFO ] After 1361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Finished Parikh walk after 197 steps, including 1 resets, run visited all 4 properties in 3 ms. (steps per millisecond=65 )
Parikh walk visited 16 properties in 25 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 36 ms
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 28 ms
[2023-03-13 19:04:48] [INFO ] Input system was already deterministic with 475 transitions.
Computed a total of 230 stabilizing places and 201 stable transitions
Graph (complete) has 1199 edges and 543 vertex of which 541 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 510 transition count 443
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 510 transition count 443
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 502 transition count 435
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 502 transition count 435
Applied a total of 81 rules in 73 ms. Remains 502 /543 variables (removed 41) and now considering 435/475 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 502/543 places, 435/475 transitions.
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 22 ms
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 22 ms
[2023-03-13 19:04:48] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 509 transition count 442
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 509 transition count 442
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 501 transition count 434
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 501 transition count 434
Applied a total of 83 rules in 67 ms. Remains 501 /543 variables (removed 42) and now considering 434/475 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 501/543 places, 434/475 transitions.
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:04:48] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 510 transition count 443
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 510 transition count 443
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 502 transition count 435
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 502 transition count 435
Applied a total of 81 rules in 54 ms. Remains 502 /543 variables (removed 41) and now considering 435/475 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 502/543 places, 435/475 transitions.
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 14 ms
[2023-03-13 19:04:48] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Graph (trivial) has 265 edges and 543 vertex of which 6 / 543 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 1193 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 535 transition count 400
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 468 transition count 400
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 136 place count 468 transition count 291
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 374 place count 339 transition count 291
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 403 place count 310 transition count 262
Iterating global reduction 2 with 29 rules applied. Total rules applied 432 place count 310 transition count 262
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 432 place count 310 transition count 260
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 436 place count 308 transition count 260
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 247 rules applied. Total rules applied 683 place count 182 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 684 place count 181 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 685 place count 180 transition count 138
Applied a total of 685 rules in 62 ms. Remains 180 /543 variables (removed 363) and now considering 138/475 (removed 337) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 180/543 places, 138/475 transitions.
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:04:48] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 518 transition count 451
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 518 transition count 451
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 513 transition count 446
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 513 transition count 446
Applied a total of 59 rules in 31 ms. Remains 513 /543 variables (removed 30) and now considering 446/475 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 513/543 places, 446/475 transitions.
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 14 ms
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:04:48] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 515 transition count 447
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 515 transition count 447
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 509 transition count 441
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 509 transition count 441
Applied a total of 68 rules in 26 ms. Remains 509 /543 variables (removed 34) and now considering 441/475 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 509/543 places, 441/475 transitions.
[2023-03-13 19:04:48] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:04:49] [INFO ] Input system was already deterministic with 441 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 511 transition count 444
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 511 transition count 444
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 503 transition count 436
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 503 transition count 436
Applied a total of 79 rules in 42 ms. Remains 503 /543 variables (removed 40) and now considering 436/475 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 503/543 places, 436/475 transitions.
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:04:49] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 509 transition count 442
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 509 transition count 442
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 501 transition count 434
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 501 transition count 434
Applied a total of 83 rules in 56 ms. Remains 501 /543 variables (removed 42) and now considering 434/475 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 501/543 places, 434/475 transitions.
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 24 ms
[2023-03-13 19:04:49] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 510 transition count 443
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 510 transition count 443
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 502 transition count 435
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 502 transition count 435
Applied a total of 81 rules in 49 ms. Remains 502 /543 variables (removed 41) and now considering 435/475 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 502/543 places, 435/475 transitions.
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 24 ms
[2023-03-13 19:04:49] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Graph (trivial) has 262 edges and 543 vertex of which 6 / 543 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 1193 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 535 transition count 401
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 469 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 468 transition count 400
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 136 place count 468 transition count 293
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 369 place count 342 transition count 293
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 397 place count 314 transition count 265
Iterating global reduction 3 with 28 rules applied. Total rules applied 425 place count 314 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 425 place count 314 transition count 263
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 429 place count 312 transition count 263
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 11 ms
Ensure Unique test removed 5 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 676 place count 186 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 185 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 678 place count 184 transition count 141
Applied a total of 678 rules in 113 ms. Remains 184 /543 variables (removed 359) and now considering 141/475 (removed 334) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 184/543 places, 141/475 transitions.
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:04:49] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 515 transition count 448
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 515 transition count 448
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 507 transition count 440
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 507 transition count 440
Applied a total of 71 rules in 54 ms. Remains 507 /543 variables (removed 36) and now considering 440/475 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 507/543 places, 440/475 transitions.
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:04:49] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 475/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 475
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 510 transition count 443
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 510 transition count 443
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 503 transition count 436
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 503 transition count 436
Applied a total of 79 rules in 47 ms. Remains 503 /543 variables (removed 40) and now considering 436/475 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 503/543 places, 436/475 transitions.
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 23 ms
[2023-03-13 19:04:49] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:04:49] [INFO ] Input system was already deterministic with 436 transitions.
[2023-03-13 19:04:50] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:04:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:04:50] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 19:04:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 543 places, 475 transitions and 1497 arcs took 2 ms.
Total runtime 15362 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: 543 NrTr: 475 NrArc: 1497)

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

net check time: 0m 0.000sec

init dd package: 0m 3.335sec


before gc: list nodes free: 867209

after gc: idd nodes used:42062456, unused:21937544; list nodes free:91002141

RS generation: 49m20.619sec


-> last computed set: #nodes 42062376 (4.2e+07) #states 269,957,743,778 (11)


CANNOT_COMPUTE


BK_STOP 1678737280692

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

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