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

About the Execution of Marcie+red for Planning-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16204.071 232848.00 226191.00 14934.30 ?TTFT??T???F?F?? normal

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.r298-tall-167873951600337.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 Planning-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951600337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:16 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 3.5K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 model.pnml
-rw-r--r-- 1 mcc users 1 Mar 5 18:23 unfinite

--------------------
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 Planning-PT-none-CTLCardinality-00
FORMULA_NAME Planning-PT-none-CTLCardinality-01
FORMULA_NAME Planning-PT-none-CTLCardinality-02
FORMULA_NAME Planning-PT-none-CTLCardinality-03
FORMULA_NAME Planning-PT-none-CTLCardinality-04
FORMULA_NAME Planning-PT-none-CTLCardinality-05
FORMULA_NAME Planning-PT-none-CTLCardinality-06
FORMULA_NAME Planning-PT-none-CTLCardinality-07
FORMULA_NAME Planning-PT-none-CTLCardinality-08
FORMULA_NAME Planning-PT-none-CTLCardinality-09
FORMULA_NAME Planning-PT-none-CTLCardinality-10
FORMULA_NAME Planning-PT-none-CTLCardinality-11
FORMULA_NAME Planning-PT-none-CTLCardinality-12
FORMULA_NAME Planning-PT-none-CTLCardinality-13
FORMULA_NAME Planning-PT-none-CTLCardinality-14
FORMULA_NAME Planning-PT-none-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679514159118

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=Planning-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 19:42:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 19:42:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:42:40] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-22 19:42:40] [INFO ] Transformed 126 places.
[2023-03-22 19:42:40] [INFO ] Transformed 128 transitions.
[2023-03-22 19:42:40] [INFO ] Parsed PT model containing 126 places and 128 transitions and 652 arcs in 102 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Reduce places removed 2 places and 0 transitions.
Support contains 98 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 128
Applied a total of 4 rules in 12 ms. Remains 120 /124 variables (removed 4) and now considering 128/128 (removed 0) transitions.
[2023-03-22 19:42:40] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 120 cols
[2023-03-22 19:42:40] [INFO ] Computed 40 place invariants in 12 ms
[2023-03-22 19:42:41] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-22 19:42:41] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2023-03-22 19:42:41] [INFO ] Invariant cache hit.
[2023-03-22 19:42:41] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-22 19:42:41] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-22 19:42:41] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2023-03-22 19:42:41] [INFO ] Invariant cache hit.
[2023-03-22 19:42:41] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/124 places, 128/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 120/124 places, 128/128 transitions.
Support contains 98 out of 120 places after structural reductions.
[2023-03-22 19:42:41] [INFO ] Flatten gal took : 29 ms
[2023-03-22 19:42:41] [INFO ] Flatten gal took : 13 ms
[2023-03-22 19:42:41] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 94) seen :64
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Running SMT prover for 30 properties.
[2023-03-22 19:42:42] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2023-03-22 19:42:42] [INFO ] Invariant cache hit.
[2023-03-22 19:42:42] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-22 19:42:42] [INFO ] [Real]Absence check using 36 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 19:42:42] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-22 19:42:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-22 19:42:42] [INFO ] [Nat]Absence check using 36 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 19:42:42] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :28 sat :2
[2023-03-22 19:42:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-22 19:42:42] [INFO ] After 14ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :28 sat :2
[2023-03-22 19:42:42] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :28 sat :2
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-22 19:42:42] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :28 sat :2
Fused 30 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 128/128 transitions.
Graph (trivial) has 41 edges and 120 vertex of which 28 / 120 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 323 edges and 106 vertex of which 49 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.1 ms
Discarding 57 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 44 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 43 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 43 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 43 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 34 place count 37 transition count 50
Applied a total of 34 rules in 23 ms. Remains 37 /120 variables (removed 83) and now considering 50/128 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 37/120 places, 50/128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :1
Finished Best-First random walk after 199 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=199 )
Successfully simplified 28 atomic propositions for a total of 16 simplifications.
FORMULA Planning-PT-none-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 19:42:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 11 ms
FORMULA Planning-PT-none-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 8 ms
[2023-03-22 19:42:42] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 53 out of 120 places (down from 63) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 553 edges and 120 vertex of which 82 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 99 transition count 123
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 40 place count 85 transition count 109
Iterating global reduction 1 with 14 rules applied. Total rules applied 54 place count 85 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 83 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 83 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 83 transition count 103
Applied a total of 60 rules in 6 ms. Remains 83 /120 variables (removed 37) and now considering 103/128 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 83/120 places, 103/128 transitions.
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 6 ms
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 5 ms
[2023-03-22 19:42:42] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Graph (trivial) has 44 edges and 120 vertex of which 28 / 120 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 531 edges and 106 vertex of which 68 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 54 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 49 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 49 transition count 56
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 35 place count 49 transition count 51
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 39 transition count 46
Applied a total of 50 rules in 9 ms. Remains 39 /120 variables (removed 81) and now considering 46/128 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 39/120 places, 46/128 transitions.
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 19:42:42] [INFO ] Input system was already deterministic with 46 transitions.
Finished random walk after 95 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=95 )
FORMULA Planning-PT-none-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Graph (trivial) has 44 edges and 120 vertex of which 28 / 120 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 531 edges and 106 vertex of which 68 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 54 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 49 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 49 transition count 56
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 35 place count 49 transition count 51
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 39 transition count 46
Applied a total of 50 rules in 7 ms. Remains 39 /120 variables (removed 81) and now considering 46/128 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 39/120 places, 46/128 transitions.
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 19:42:42] [INFO ] Input system was already deterministic with 46 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
FORMULA Planning-PT-none-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Graph (trivial) has 41 edges and 120 vertex of which 26 / 120 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 532 edges and 107 vertex of which 72 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 59 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 55 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 55 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 30 place count 55 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 42 place count 47 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 45 transition count 67
Applied a total of 45 rules in 10 ms. Remains 45 /120 variables (removed 75) and now considering 67/128 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 45/120 places, 67/128 transitions.
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 4 ms
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 4 ms
[2023-03-22 19:42:42] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 98 transition count 123
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 41 place count 84 transition count 109
Iterating global reduction 1 with 14 rules applied. Total rules applied 55 place count 84 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 81 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 81 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 81 transition count 100
Applied a total of 64 rules in 5 ms. Remains 81 /120 variables (removed 39) and now considering 100/128 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 81/120 places, 100/128 transitions.
[2023-03-22 19:42:42] [INFO ] Flatten gal took : 4 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 11 ms
[2023-03-22 19:42:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 98 transition count 123
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 41 place count 84 transition count 109
Iterating global reduction 1 with 14 rules applied. Total rules applied 55 place count 84 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 81 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 81 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 81 transition count 100
Applied a total of 64 rules in 4 ms. Remains 81 /120 variables (removed 39) and now considering 100/128 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 81/120 places, 100/128 transitions.
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 19:42:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 124
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 39 place count 85 transition count 110
Iterating global reduction 1 with 14 rules applied. Total rules applied 53 place count 85 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 84 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 84 transition count 107
Applied a total of 56 rules in 5 ms. Remains 84 /120 variables (removed 36) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 84/120 places, 107/128 transitions.
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 19:42:43] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 98 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 42 place count 83 transition count 108
Iterating global reduction 1 with 15 rules applied. Total rules applied 57 place count 83 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 78 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 78 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 72 place count 78 transition count 79
Applied a total of 72 rules in 5 ms. Remains 78 /120 variables (removed 42) and now considering 79/128 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 78/120 places, 79/128 transitions.
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 19:42:43] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 101 transition count 124
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 35 place count 89 transition count 112
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 89 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 87 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 87 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 87 transition count 106
Applied a total of 53 rules in 3 ms. Remains 87 /120 variables (removed 33) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 87/120 places, 106/128 transitions.
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 19:42:43] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 99 transition count 123
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 89 transition count 113
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 88 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 88 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 88 transition count 110
Applied a total of 49 rules in 3 ms. Remains 88 /120 variables (removed 32) and now considering 110/128 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 88/120 places, 110/128 transitions.
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 19:42:43] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 128/128 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 100 transition count 125
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 36 place count 87 transition count 112
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 84 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 84 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 84 transition count 103
Applied a total of 58 rules in 2 ms. Remains 84 /120 variables (removed 36) and now considering 103/128 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/120 places, 103/128 transitions.
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 19:42:43] [INFO ] Input system was already deterministic with 103 transitions.
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 19:42:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 19:42:43] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 19:42:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 120 places, 128 transitions and 605 arcs took 2 ms.
Total runtime 2644 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: 120 NrTr: 128 NrArc: 605)

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

net check time: 0m 0.000sec

init dd package: 0m 2.770sec


BK_STOP 1679514391966

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

4963/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 467 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="Planning-PT-none"
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 Planning-PT-none, 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 r298-tall-167873951600337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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