Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863541000505.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PermAdmissibility-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541000505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 150K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 550K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 484K Mar 5 18:23 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 PermAdmissibility-PT-01-CTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679103494557

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=PermAdmissibility-PT-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 01:38:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 01:38:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:38:18] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2023-03-18 01:38:18] [INFO ] Transformed 168 places.
[2023-03-18 01:38:18] [INFO ] Transformed 592 transitions.
[2023-03-18 01:38:18] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 149 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 158 transition count 592
Applied a total of 10 rules in 28 ms. Remains 158 /168 variables (removed 10) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 158 cols
[2023-03-18 01:38:18] [INFO ] Computed 22 place invariants in 56 ms
[2023-03-18 01:38:18] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-18 01:38:18] [INFO ] Invariant cache hit.
[2023-03-18 01:38:19] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-18 01:38:19] [INFO ] Invariant cache hit.
[2023-03-18 01:38:19] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1491 ms. Remains : 158/168 places, 592/592 transitions.
Support contains 149 out of 158 places after structural reductions.
[2023-03-18 01:38:20] [INFO ] Flatten gal took : 177 ms
[2023-03-18 01:38:20] [INFO ] Flatten gal took : 85 ms
[2023-03-18 01:38:20] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 836 ms. (steps per millisecond=11 ) properties (out of 78) seen :45
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
[2023-03-18 01:38:22] [INFO ] Invariant cache hit.
[2023-03-18 01:38:23] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 11 ms returned sat
[2023-03-18 01:38:23] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:28
[2023-03-18 01:38:23] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-18 01:38:23] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :33 sat :0
Fused 33 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 33 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-01-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 01:38:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 01:38:23] [INFO ] Flatten gal took : 66 ms
[2023-03-18 01:38:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PermAdmissibility-PT-01-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 01:38:23] [INFO ] Flatten gal took : 53 ms
[2023-03-18 01:38:23] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 58 out of 158 places (down from 69) after GAL structural reductions.
Computed a total of 158 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA PermAdmissibility-PT-01-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 112 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 99 transition count 384
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 99 transition count 384
Applied a total of 72 rules in 27 ms. Remains 99 /158 variables (removed 59) and now considering 384/592 (removed 208) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 99/158 places, 384/592 transitions.
[2023-03-18 01:38:23] [INFO ] Flatten gal took : 22 ms
[2023-03-18 01:38:23] [INFO ] Flatten gal took : 24 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 104 transition count 592
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 85 transition count 372
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 75 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 75 transition count 262
Applied a total of 112 rules in 25 ms. Remains 75 /158 variables (removed 83) and now considering 262/592 (removed 330) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 75/158 places, 262/592 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 14 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 18 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Graph (complete) has 1515 edges and 158 vertex of which 87 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.7 ms
Discarding 71 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 75 transition count 344
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 75 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 49 place count 51 transition count 104
Iterating global reduction 0 with 24 rules applied. Total rules applied 73 place count 51 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 49 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 49 transition count 88
Applied a total of 77 rules in 41 ms. Remains 49 /158 variables (removed 109) and now considering 88/592 (removed 504) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 49/158 places, 88/592 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 88 transitions.
Finished random walk after 118 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=39 )
FORMULA PermAdmissibility-PT-01-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 113 transition count 592
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 98 transition count 404
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 98 transition count 404
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 94 transition count 344
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 94 transition count 344
Applied a total of 83 rules in 12 ms. Remains 94 /158 variables (removed 64) and now considering 344/592 (removed 248) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 94/158 places, 344/592 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 16 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 18 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 106 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 76 place count 82 transition count 352
Iterating global reduction 1 with 24 rules applied. Total rules applied 100 place count 82 transition count 352
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 119 place count 63 transition count 144
Iterating global reduction 1 with 19 rules applied. Total rules applied 138 place count 63 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 62 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 62 transition count 136
Applied a total of 140 rules in 13 ms. Remains 62 /158 variables (removed 96) and now considering 136/592 (removed 456) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 62/158 places, 136/592 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 7 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 8 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 80 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 106 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 130 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 154 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 157 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 160 place count 51 transition count 84
Applied a total of 160 rules in 11 ms. Remains 51 /158 variables (removed 107) and now considering 84/592 (removed 508) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 51/158 places, 84/592 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 106 transition count 592
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 74 place count 84 transition count 364
Iterating global reduction 1 with 22 rules applied. Total rules applied 96 place count 84 transition count 364
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 110 place count 70 transition count 192
Iterating global reduction 1 with 14 rules applied. Total rules applied 124 place count 70 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 69 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 69 transition count 184
Applied a total of 126 rules in 11 ms. Remains 69 /158 variables (removed 89) and now considering 184/592 (removed 408) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 69/158 places, 184/592 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 9 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 10 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 592/592 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 106 transition count 592
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 74 place count 84 transition count 356
Iterating global reduction 1 with 22 rules applied. Total rules applied 96 place count 84 transition count 356
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 114 place count 66 transition count 158
Iterating global reduction 1 with 18 rules applied. Total rules applied 132 place count 66 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 65 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 65 transition count 150
Applied a total of 134 rules in 15 ms. Remains 65 /158 variables (removed 93) and now considering 150/592 (removed 442) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 65/158 places, 150/592 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 7 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 8 ms
[2023-03-18 01:38:24] [INFO ] Input system was already deterministic with 150 transitions.
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 31 ms
[2023-03-18 01:38:24] [INFO ] Flatten gal took : 31 ms
[2023-03-18 01:38:24] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 01:38:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 592 transitions and 3376 arcs took 7 ms.
Total runtime 6450 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: 158 NrTr: 592 NrArc: 3376)

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

net check time: 0m 0.001sec

init dd package: 0m 3.601sec


RS generation: 0m20.025sec


-> reachability set: #nodes 59159 (5.9e+04) #states 52,537 (4)



starting MCC model checker
--------------------------

checking: E [p95<=0 U EX [0<=0]]
normalized: E [p95<=0 U EX [0<=0]]

abstracting: (0<=0)
states: 52,537 (4)
.abstracting: (p95<=0)
states: 52,391 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.176sec

checking: EX [A [p25<=p145 U ~ [EG [[AF [p17<=p128] | 1<=p111]]]]]
normalized: EX [[~ [E [EG [[~ [EG [~ [p17<=p128]]] | 1<=p111]] U [EG [[~ [EG [~ [p17<=p128]]] | 1<=p111]] & ~ [p25<=p145]]]] & ~ [EG [EG [[~ [EG [~ [p17<=p128]]] | 1<=p111]]]]]]

abstracting: (1<=p111)
states: 240
abstracting: (p17<=p128)
states: 50,201 (4)
.
EG iterations: 1
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p25<=p145)
states: 50,201 (4)
abstracting: (1<=p111)
states: 240
abstracting: (p17<=p128)
states: 50,201 (4)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p111)
states: 240
abstracting: (p17<=p128)
states: 50,201 (4)
.
EG iterations: 1
..
EG iterations: 2
.-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.168sec

checking: [AF [EG [[1<=p9 & AF [p65<=p8]]]] & AX [A [EG [1<=p84] U EX [p69<=0]]]]
normalized: [~ [EG [~ [EG [[1<=p9 & ~ [EG [~ [p65<=p8]]]]]]]] & ~ [EX [~ [[~ [EG [~ [EX [p69<=0]]]] & ~ [E [~ [EX [p69<=0]] U [~ [EX [p69<=0]] & ~ [EG [1<=p84]]]]]]]]]]

abstracting: (1<=p84)
states: 146
.......
EG iterations: 7
abstracting: (p69<=0)
states: 47,281 (4)
.abstracting: (p69<=0)
states: 47,281 (4)
.abstracting: (p69<=0)
states: 47,281 (4)
..
EG iterations: 1
.abstracting: (p65<=p8)
states: 47,281 (4)
.
EG iterations: 1
abstracting: (1<=p9)
states: 5,732 (3)
.......
EG iterations: 7

EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.576sec

checking: AX [AX [[p144<=p105 & [[EF [1<=p44] | ~ [p51<=0]] & [p72<=1 | p63<=0]]]]]
normalized: ~ [EX [EX [~ [[p144<=p105 & [[p72<=1 | p63<=0] & [~ [p51<=0] | E [true U 1<=p44]]]]]]]]

abstracting: (1<=p44)
states: 1,460 (3)
abstracting: (p51<=0)
states: 50,669 (4)
abstracting: (p63<=0)
states: 47,281 (4)
abstracting: (p72<=1)
states: 52,537 (4)
abstracting: (p144<=p105)
states: 52,353 (4)
..-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.020sec

checking: AG [AF [EX [sum(p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p90, p89, p88, p87, p86, p85, p83, p80)]]]
normalized: ~ [E [true U EG [~ [EX [sum(p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p90, p89, p88, p87, p86, p85, p83, p80)]]]]]

abstracting: (sum(p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p90, p89, p88, p87, p86, p85, p83, p80))
states: 42,025 (4)
.....
EG iterations: 4
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m36.969sec

checking: EG [[AX [EG [~ [sum(p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p138, p137)]]] | [AG [EF [~ [p92<=sum(p130, p129, p116, p115)]]] | AX [p56<=p142]]]]
normalized: EG [[~ [EX [~ [EG [~ [sum(p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p138, p137)]]]]] | [~ [EX [~ [p56<=p142]]] | ~ [E [true U ~ [E [true U ~ [p92<=sum(p130, p129, p116, p115)]]]]]]]]

abstracting: (p92<=sum(p130, p129, p116, p115))
states: 52,281 (4)
abstracting: (p56<=p142)
states: 47,865 (4)
.abstracting: (sum(p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p138, p137))
states: 23,337 (4)
.....
EG iterations: 5
..............
EG iterations: 13
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.959sec

checking: EG [[[EG [[~ [p24<=p141] & ~ [1<=p118]]] | A [1<=p8 U EF [p139<=p90]]] | [EX [p73<=p26] | [[[[~ [p101<=p113] | ~ [1<=p87]] & [~ [1<=p61] | ~ [p30<=p44]]] & 1<=p118] | [EF [[AF [1<=p133] & AG [1<=p146]]] & [E [~ [EX [p80<=p30]] U ~ [AF [p126<=p105]]] & [EX [~ [1<=p85]] | EF [p102<=p33]]]]]]]]
normalized: EG [[[[~ [EG [~ [E [true U p139<=p90]]]] & ~ [E [~ [E [true U p139<=p90]] U [~ [1<=p8] & ~ [E [true U p139<=p90]]]]]] | EG [[~ [1<=p118] & ~ [p24<=p141]]]] | [[[E [true U [~ [EG [~ [1<=p133]]] & ~ [E [true U ~ [1<=p146]]]]] & [[E [true U p102<=p33] | EX [~ [1<=p85]]] & E [~ [EX [p80<=p30]] U EG [~ [p126<=p105]]]]] | [1<=p118 & [[~ [p30<=p44] | ~ [1<=p61]] & [~ [1<=p87] | ~ [p101<=p113]]]]] | EX [p73<=p26]]]]

abstracting: (p73<=p26)
states: 46,989 (4)
.abstracting: (p101<=p113)
states: 51,773 (4)
abstracting: (1<=p87)
states: 5,840 (3)
abstracting: (1<=p61)
states: 1,868 (3)
abstracting: (p30<=p44)
states: 47,865 (4)
abstracting: (1<=p118)
states: 64
abstracting: (p126<=p105)
states: 52,501 (4)
......
EG iterations: 6
abstracting: (p80<=p30)
states: 46,697 (4)
.abstracting: (1<=p85)
states: 5,840 (3)
.abstracting: (p102<=p33)
states: 51,773 (4)
abstracting: (1<=p146)
states: 272
abstracting: (1<=p133)
states: 272
.
EG iterations: 1
abstracting: (p24<=p141)
states: 50,201 (4)
abstracting: (1<=p118)
states: 64
.
EG iterations: 1
abstracting: (p139<=p90)
states: 51,693 (4)
abstracting: (1<=p8)
states: 5,732 (3)
abstracting: (p139<=p90)
states: 51,693 (4)
abstracting: (p139<=p90)
states: 51,693 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.917sec

totally nodes used: 48904942 (4.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 88019325 381557648 469576973
used/not used/entry size/cache size: 66912123 196741 16 1024MB
basic ops cache: hits/miss/sum: 10912817 49103651 60016468
used/not used/entry size/cache size: 16719756 57460 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 66589 66589
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 32306 172859 205165
used/not used/entry size/cache size: 171151 8217457 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 33729556
1 21709092
2 8584029
3 2444188
4 532694
5 93666
6 13639
7 1768
8 192
9 32
>= 10 8

Total processing time: 3m13.545sec


BK_STOP 1679103699301

--------------------
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

6092 13313 21531 25846 28892 42982
iterations count:624967 (1055), effective:3528 (5)

initing FirstDep: 0m 0.002sec


iterations count:592 (1), effective:0 (0)
12692 16389 18563 20644 21526
iterations count:524702 (886), effective:2251 (3)

iterations count:592 (1), effective:0 (0)

iterations count:43887 (74), effective:431 (0)
24893 28820 30807 32780 34453 37825 40816 43402 44926 45095 49986 51965 53077 54108 56321 55908 58090 59375 60579 61003
iterations count:2038848 (3444), effective:8315 (14)

iterations count:4326 (7), effective:61 (0)

iterations count:7588 (12), effective:89 (0)

iterations count:16583 (28), effective:160 (0)

iterations count:6139 (10), effective:41 (0)

iterations count:20933 (35), effective:181 (0)

iterations count:20933 (35), effective:181 (0)

iterations count:20933 (35), effective:181 (0)

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="PermAdmissibility-PT-01"
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 PermAdmissibility-PT-01, 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 r266-smll-167863541000505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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