About the Execution of Marcie+red for ClientsAndServers-PT-N0002P0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5586.867 | 18071.00 | 26408.00 | 595.40 | FFFFFFFFTTFTFTTF | 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.r074-smll-167814400000209.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 ClientsAndServers-PT-N0002P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400000209
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N0002P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678333673573
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=ClientsAndServers-PT-N0002P0
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 03:47:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 03:47:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:47:57] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-09 03:47:57] [INFO ] Transformed 25 places.
[2023-03-09 03:47:57] [INFO ] Transformed 18 transitions.
[2023-03-09 03:47:57] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 14 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 03:47:57] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-09 03:47:57] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-09 03:47:57] [INFO ] Invariant cache hit.
[2023-03-09 03:47:57] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-09 03:47:57] [INFO ] Invariant cache hit.
[2023-03-09 03:47:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-09 03:47:58] [INFO ] Flatten gal took : 23 ms
[2023-03-09 03:47:58] [INFO ] Flatten gal took : 9 ms
[2023-03-09 03:47:58] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10002 steps, including 34 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 66) seen :36
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 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 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) 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 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 9 ms. (steps per millisecond=111 ) 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 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2023-03-09 03:47:59] [INFO ] Invariant cache hit.
[2023-03-09 03:47:59] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 03:47:59] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 03:47:59] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:28
[2023-03-09 03:47:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 03:47:59] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 03:47:59] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :27 sat :2
[2023-03-09 03:47:59] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :27 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 03:47:59] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :27 sat :2
Fused 29 Parikh solutions to 2 different solutions.
Finished Parikh walk after 248 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=35 )
Parikh walk visited 2 properties in 10 ms.
Successfully simplified 27 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 03:47:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 6 ms
[2023-03-09 03:47:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 5 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 23 out of 25 places (down from 24) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
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 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 11 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 12/25 places, 8/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 18 transition count 13
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 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 15 transition count 10
Applied a total of 18 rules in 9 ms. Remains 15 /25 variables (removed 10) and now considering 10/18 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 15/25 places, 10/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 18 transition count 13
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 17 transition count 12
Applied a total of 14 rules in 7 ms. Remains 17 /25 variables (removed 8) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 17/25 places, 12/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 13 transition count 10
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 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 6 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 10/25 places, 7/18 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:47:59] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:47:59] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-09 03:47:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 2720 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: 25 NrTr: 18 NrArc: 54)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.591sec
RS generation: 0m 0.746sec
-> reachability set: #nodes 17697 (1.8e+04) #states 7,081,638 (6)
starting MCC model checker
--------------------------
checking: AF [AG [EX [0<=0]]]
normalized: ~ [EG [E [true U ~ [EX [0<=0]]]]]
abstracting: (0<=0)
states: 7,081,638 (6)
.
EG iterations: 0
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.297sec
checking: AX [AX [EF [EX [AX [1<=0]]]]]
normalized: ~ [EX [EX [~ [E [true U EX [~ [EX [~ [1<=0]]]]]]]]]
abstracting: (1<=0)
states: 0
....-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: AX [EG [p13<=p6]]
normalized: ~ [EX [~ [EG [p13<=p6]]]]
abstracting: (p13<=p6)
states: 5,462,381 (6)
..............................................................
EG iterations: 62
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.424sec
checking: EG [p5<=p11]
normalized: EG [p5<=p11]
abstracting: (p5<=p11)
states: 3,018,948 (6)
................................................
EG iterations: 48
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.460sec
checking: [EF [AG [AF [[~ [3<=p22] | ~ [p13<=11]]]]] & EF [~ [p21<=7]]]
normalized: [E [true U ~ [p21<=7]] & E [true U ~ [E [true U EG [~ [[~ [p13<=11] | ~ [3<=p22]]]]]]]]
abstracting: (3<=p22)
states: 1,511,349 (6)
abstracting: (p13<=11)
states: 7,081,638 (6)
............................
EG iterations: 28
abstracting: (p21<=7)
states: 5,060,091 (6)
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.029sec
checking: AG [[AG [[p16<=p24 | EF [~ [p0<=p12]]]] | AX [1<=0]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [1<=0]]] | ~ [E [true U ~ [[p16<=p24 | E [true U ~ [p0<=p12]]]]]]]]]]
abstracting: (p0<=p12)
states: 1,894,731 (6)
abstracting: (p16<=p24)
states: 6,593,198 (6)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: EF [[AF [AG [1<=p17]] & E [EG [4<=p13] U [p18<=p23 & p8<=6]]]]
normalized: E [true U [E [EG [4<=p13] U [p18<=p23 & p8<=6]] & ~ [EG [E [true U ~ [1<=p17]]]]]]
abstracting: (1<=p17)
states: 5,062,183 (6)
..........................
EG iterations: 26
abstracting: (p8<=6)
states: 6,495,563 (6)
abstracting: (p18<=p23)
states: 7,081,638 (6)
abstracting: (4<=p13)
states: 4,917 (3)
..........................
EG iterations: 26
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.069sec
checking: AF [AX [AG [[~ [p0<=p20] | [~ [p22<=p9] | ~ [p11<=p0]]]]]]
normalized: ~ [EG [EX [E [true U ~ [[[~ [p11<=p0] | ~ [p22<=p9]] | ~ [p0<=p20]]]]]]]
abstracting: (p0<=p20)
states: 1,944,120 (6)
abstracting: (p22<=p9)
states: 3,120,825 (6)
abstracting: (p11<=p0)
states: 6,643,134 (6)
..................................
EG iterations: 33
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.311sec
checking: AF [[p20<=p24 & EG [[A [p23<=4 U p4<=p11] | ~ [p17<=p3]]]]]
normalized: ~ [EG [~ [[p20<=p24 & EG [[~ [p17<=p3] | [~ [EG [~ [p4<=p11]]] & ~ [E [~ [p4<=p11] U [~ [p23<=4] & ~ [p4<=p11]]]]]]]]]]]
abstracting: (p4<=p11)
states: 1,750,227 (6)
abstracting: (p23<=4)
states: 2,440,065 (6)
abstracting: (p4<=p11)
states: 1,750,227 (6)
abstracting: (p4<=p11)
states: 1,750,227 (6)
.................................
EG iterations: 33
abstracting: (p17<=p3)
states: 2,990,475 (6)
......................................
EG iterations: 38
abstracting: (p20<=p24)
states: 6,597,023 (6)
........................................
EG iterations: 40
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.388sec
checking: A [~ [p15<=2] U ~ [[~ [AG [[[p6<=5 & p20<=3] | ~ [p10<=p6]]]] | ~ [[[AX [2<=p13] | [p2<=p20 | [1<=p3 & ~ [p20<=p0]]]] & [AX [p4<=12] | ~ [E [p7<=6 U p17<=p14]]]]]]]]
normalized: [~ [EG [[~ [[[~ [E [p7<=6 U p17<=p14]] | ~ [EX [~ [p4<=12]]]] & [[p2<=p20 | [1<=p3 & ~ [p20<=p0]]] | ~ [EX [~ [2<=p13]]]]]] | E [true U ~ [[~ [p10<=p6] | [p6<=5 & p20<=3]]]]]]] & ~ [E [[~ [[[~ [E [p7<=6 U p17<=p14]] | ~ [EX [~ [p4<=12]]]] & [[p2<=p20 | [1<=p3 & ~ [p20<=p0]]] | ~ [EX [~ [2<=p13]]]]]] | E [true U ~ [[~ [p10<=p6] | [p6<=5 & p20<=3]]]]] U [p15<=2 & [~ [[[~ [E [p7<=6 U p17<=p14]] | ~ [EX [~ [p4<=12]]]] & [[p2<=p20 | [1<=p3 & ~ [p20<=p0]]] | ~ [EX [~ [2<=p13]]]]]] | E [true U ~ [[~ [p10<=p6] | [p6<=5 & p20<=3]]]]]]]]]
abstracting: (p20<=3)
states: 7,077,396 (6)
abstracting: (p6<=5)
states: 7,081,638 (6)
abstracting: (p10<=p6)
states: 5,776,402 (6)
abstracting: (2<=p13)
states: 406,071 (5)
.abstracting: (p20<=p0)
states: 6,635,583 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (p2<=p20)
states: 5,841,062 (6)
abstracting: (p4<=12)
states: 7,080,498 (6)
.abstracting: (p17<=p14)
states: 7,008,899 (6)
abstracting: (p7<=6)
states: 7,053,123 (6)
abstracting: (p15<=2)
states: 6,967,707 (6)
abstracting: (p20<=3)
states: 7,077,396 (6)
abstracting: (p6<=5)
states: 7,081,638 (6)
abstracting: (p10<=p6)
states: 5,776,402 (6)
abstracting: (2<=p13)
states: 406,071 (5)
.abstracting: (p20<=p0)
states: 6,635,583 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (p2<=p20)
states: 5,841,062 (6)
abstracting: (p4<=12)
states: 7,080,498 (6)
.abstracting: (p17<=p14)
states: 7,008,899 (6)
abstracting: (p7<=6)
states: 7,053,123 (6)
abstracting: (p20<=3)
states: 7,077,396 (6)
abstracting: (p6<=5)
states: 7,081,638 (6)
abstracting: (p10<=p6)
states: 5,776,402 (6)
abstracting: (2<=p13)
states: 406,071 (5)
.abstracting: (p20<=p0)
states: 6,635,583 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (p2<=p20)
states: 5,841,062 (6)
abstracting: (p4<=12)
states: 7,080,498 (6)
.abstracting: (p17<=p14)
states: 7,008,899 (6)
abstracting: (p7<=6)
states: 7,053,123 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.232sec
totally nodes used: 1560833 (1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6072571 5165476 11238047
used/not used/entry size/cache size: 6087047 61021817 16 1024MB
basic ops cache: hits/miss/sum: 1544309 1511733 3056042
used/not used/entry size/cache size: 2247333 14529883 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 179669 134541 314210
used/not used/entry size/cache size: 133512 8255096 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 65689816
1 1340006
2 64145
3 7709
4 1817
5 1138
6 478
7 807
8 302
9 289
>= 10 2357
Total processing time: 0m10.536sec
BK_STOP 1678333691644
--------------------
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
iterations count:2022 (112), effective:438 (24)
initing FirstDep: 0m 0.000sec
iterations count:717 (39), effective:159 (8)
iterations count:717 (39), effective:160 (8)
iterations count:367 (20), effective:76 (4)
iterations count:629 (34), effective:127 (7)
iterations count:415 (23), effective:92 (5)
iterations count:90 (5), effective:16 (0)
iterations count:661 (36), effective:131 (7)
iterations count:18 (1), effective:0 (0)
iterations count:268 (14), effective:58 (3)
iterations count:18 (1), effective:0 (0)
iterations count:629 (34), effective:127 (7)
iterations count:458 (25), effective:103 (5)
iterations count:90 (5), effective:14 (0)
iterations count:382 (21), effective:77 (4)
iterations count:45 (2), effective:5 (0)
iterations count:382 (21), effective:77 (4)
iterations count:45 (2), effective:5 (0)
iterations count:66 (3), effective:12 (0)
iterations count:382 (21), effective:77 (4)
iterations count:45 (2), effective:5 (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="ClientsAndServers-PT-N0002P0"
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 ClientsAndServers-PT-N0002P0, 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 r074-smll-167814400000209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0002P0.tgz
mv ClientsAndServers-PT-N0002P0 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 '
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 ;