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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9948.008 2516593.00 2547909.00 345.40 ???????F?T??F?FF 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-167813695800489.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-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-06-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678728181318

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-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:23:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:23:03] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-13 17:23:03] [INFO ] Transformed 376 places.
[2023-03-13 17:23:03] [INFO ] Transformed 297 transitions.
[2023-03-13 17:23:03] [INFO ] Found NUPN structural information;
[2023-03-13 17:23:03] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 345 transition count 268
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 345 transition count 268
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 334 transition count 257
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 334 transition count 257
Applied a total of 80 rules in 56 ms. Remains 334 /375 variables (removed 41) and now considering 257/296 (removed 39) transitions.
// Phase 1: matrix 257 rows 334 cols
[2023-03-13 17:23:03] [INFO ] Computed 79 place invariants in 21 ms
[2023-03-13 17:23:03] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-13 17:23:03] [INFO ] Invariant cache hit.
[2023-03-13 17:23:03] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2023-03-13 17:23:03] [INFO ] Invariant cache hit.
[2023-03-13 17:23:03] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/375 places, 257/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 334/375 places, 257/296 transitions.
Support contains 87 out of 334 places after structural reductions.
[2023-03-13 17:23:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 17:23:04] [INFO ] Flatten gal took : 43 ms
[2023-03-13 17:23:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-06-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:23:04] [INFO ] Flatten gal took : 18 ms
[2023-03-13 17:23:04] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 76 out of 334 places (down from 87) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 55) seen :43
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 17:23:05] [INFO ] Invariant cache hit.
[2023-03-13 17:23:05] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 17:23:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-13 17:23:05] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 10 ms returned sat
[2023-03-13 17:23:05] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 17:23:05] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 4 ms to minimize.
[2023-03-13 17:23:05] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-13 17:23:05] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-03-13 17:23:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-03-13 17:23:05] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2023-03-13 17:23:06] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1088 ms
[2023-03-13 17:23:06] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-13 17:23:06] [INFO ] After 1468ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 154 edges and 334 vertex of which 6 / 334 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 640 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 328 transition count 208
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 288 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 286 transition count 206
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 86 place count 286 transition count 141
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 225 place count 212 transition count 141
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 244 place count 193 transition count 122
Iterating global reduction 3 with 19 rules applied. Total rules applied 263 place count 193 transition count 122
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 421 place count 110 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 422 place count 110 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 109 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 424 place count 109 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 425 place count 108 transition count 45
Applied a total of 425 rules in 70 ms. Remains 108 /334 variables (removed 226) and now considering 45/257 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 108/334 places, 45/257 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=10 )
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-13 17:23:06] [INFO ] Flatten gal took : 18 ms
[2023-03-13 17:23:06] [INFO ] Flatten gal took : 16 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 257 transitions.
Computed a total of 327 stabilizing places and 248 stable transitions
Graph (complete) has 647 edges and 334 vertex of which 333 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 315 transition count 238
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 309 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 309 transition count 232
Applied a total of 50 rules in 27 ms. Remains 309 /334 variables (removed 25) and now considering 232/257 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 309/334 places, 232/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 315 transition count 238
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 309 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 309 transition count 232
Applied a total of 50 rules in 34 ms. Remains 309 /334 variables (removed 25) and now considering 232/257 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 309/334 places, 232/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 13 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 152 edges and 334 vertex of which 6 / 334 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 327 transition count 209
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 287 transition count 209
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 82 place count 287 transition count 145
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 220 place count 213 transition count 145
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 238 place count 195 transition count 127
Iterating global reduction 2 with 18 rules applied. Total rules applied 256 place count 195 transition count 127
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 414 place count 112 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 111 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 110 transition count 51
Applied a total of 416 rules in 38 ms. Remains 110 /334 variables (removed 224) and now considering 51/257 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 110/334 places, 51/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 323 transition count 246
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 323 transition count 246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 320 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 320 transition count 243
Applied a total of 28 rules in 16 ms. Remains 320 /334 variables (removed 14) and now considering 243/257 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 320/334 places, 243/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 19 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 317 transition count 240
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 311 transition count 234
Applied a total of 46 rules in 22 ms. Remains 311 /334 variables (removed 23) and now considering 234/257 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 311/334 places, 234/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 152 edges and 334 vertex of which 6 / 334 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 327 transition count 208
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 286 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 285 transition count 207
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 86 place count 285 transition count 144
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 221 place count 213 transition count 144
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 239 place count 195 transition count 126
Iterating global reduction 3 with 18 rules applied. Total rules applied 257 place count 195 transition count 126
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 413 place count 113 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 414 place count 112 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 111 transition count 51
Applied a total of 415 rules in 36 ms. Remains 111 /334 variables (removed 223) and now considering 51/257 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 111/334 places, 51/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 156 edges and 334 vertex of which 6 / 334 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 327 transition count 208
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 286 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 285 transition count 207
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 86 place count 285 transition count 142
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 225 place count 211 transition count 142
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 244 place count 192 transition count 123
Iterating global reduction 3 with 19 rules applied. Total rules applied 263 place count 192 transition count 123
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 412 place count 117 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 116 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 115 transition count 48
Applied a total of 414 rules in 36 ms. Remains 115 /334 variables (removed 219) and now considering 48/257 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 115/334 places, 48/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 317 transition count 240
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 317 transition count 240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 312 transition count 235
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 312 transition count 235
Applied a total of 44 rules in 18 ms. Remains 312 /334 variables (removed 22) and now considering 235/257 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 312/334 places, 235/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 317 transition count 240
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 311 transition count 234
Applied a total of 46 rules in 18 ms. Remains 311 /334 variables (removed 23) and now considering 234/257 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 311/334 places, 234/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 315 transition count 238
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 309 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 309 transition count 232
Applied a total of 50 rules in 16 ms. Remains 309 /334 variables (removed 25) and now considering 232/257 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 309/334 places, 232/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 155 edges and 334 vertex of which 6 / 334 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 641 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 327 transition count 208
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 286 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 285 transition count 207
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 86 place count 285 transition count 142
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 226 place count 210 transition count 142
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 244 place count 192 transition count 124
Iterating global reduction 3 with 18 rules applied. Total rules applied 262 place count 192 transition count 124
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 415 place count 113 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 416 place count 112 transition count 49
Applied a total of 416 rules in 28 ms. Remains 112 /334 variables (removed 222) and now considering 49/257 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 112/334 places, 49/257 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:23:07] [INFO ] Input system was already deterministic with 49 transitions.
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:23:07] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:23:07] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 17:23:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 334 places, 257 transitions and 748 arcs took 2 ms.
Total runtime 4874 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: 334 NrTr: 257 NrArc: 748)

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

net check time: 0m 0.000sec

init dd package: 0m 2.890sec


before gc: list nodes free: 1523720

after gc: idd nodes used:59095558, unused:4904442; list nodes free:22261653

RS generation: 41m11.164sec


-> last computed set: #nodes 59095547 (5.9e+07) #states 56,247,923,412 (10)


CANNOT_COMPUTE


BK_STOP 1678730697911

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

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

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