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-167814400000217.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-N0002P1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400000217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:14 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.3K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:15 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.2K 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-N0002P1-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678333893694

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-N0002P1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 03:51:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 03:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:51:37] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-09 03:51:37] [INFO ] Transformed 25 places.
[2023-03-09 03:51:37] [INFO ] Transformed 18 transitions.
[2023-03-09 03:51:37] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 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 19 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:51:37] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-09 03:51:37] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-09 03:51:37] [INFO ] Invariant cache hit.
[2023-03-09 03:51:37] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-09 03:51:37] [INFO ] Invariant cache hit.
[2023-03-09 03:51:37] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-09 03:51:38] [INFO ] Flatten gal took : 32 ms
[2023-03-09 03:51:38] [INFO ] Flatten gal took : 13 ms
[2023-03-09 03:51:38] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 72) seen :40
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) 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 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-03-09 03:51:39] [INFO ] Invariant cache hit.
[2023-03-09 03:51:39] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2023-03-09 03:51:39] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-09 03:51:39] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:30
[2023-03-09 03:51:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 03:51:39] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-09 03:51:39] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :28 sat :4
[2023-03-09 03:51:39] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :28 sat :4
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-09 03:51:39] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :28 sat :4
Fused 32 Parikh solutions to 4 different solutions.
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Parikh walk visited 4 properties in 42 ms.
Successfully simplified 28 atomic propositions for a total of 16 simplifications.
FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 03:51:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-09 03:51:39] [INFO ] Flatten gal took : 10 ms
[2023-03-09 03:51:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 6 ms
[2023-03-09 03:51:40] [INFO ] Input system was already deterministic with 18 transitions.
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 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:51:40] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:51:40] [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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 16 transition count 12
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 2 with 6 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 16 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 13/25 places, 9/18 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [INFO ] Input system was already deterministic with 9 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:51:40] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [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:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:51:40] [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:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [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 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [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 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 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 12 place count 17 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 14 place count 16 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 20 place count 13 transition count 10
Applied a total of 20 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 13/25 places, 10/18 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [INFO ] Input system was already deterministic with 10 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 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [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:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [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 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [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 4 places :
Implicit places reduction removed 4 places
Performed 3 Post agglomeration using F-continuation condition.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.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 18 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 16 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 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Applied a total of 16 rules in 5 ms. Remains 15 /25 variables (removed 10) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 15/25 places, 12/18 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:51:40] [INFO ] Input system was already deterministic with 12 transitions.
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:51:40] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:51:40] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-09 03:51:40] [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 3545 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.003sec

init dd package: 0m 3.699sec


RS generation: 0m 0.787sec


-> reachability set: #nodes 26665 (2.7e+04) #states 12,462,173 (7)



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

checking: EX [EF [16<=p5]]
normalized: EX [E [true U 16<=p5]]

abstracting: (16<=p5)
states: 1
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.553sec

checking: EF [AX [EG [~ [1<=p17]]]]
normalized: E [true U ~ [EX [~ [EG [~ [1<=p17]]]]]]

abstracting: (1<=p17)
states: 8,859,924 (6)
..........................................................................................................................................................................................
EG iterations: 186
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.416sec

checking: EF [AG [EX [~ [p20<=p19]]]]
normalized: E [true U ~ [E [true U ~ [EX [~ [p20<=p19]]]]]]

abstracting: (p20<=p19)
states: 11,070,349 (7)
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: AX [AX [EF [AG [p15<=p23]]]]
normalized: ~ [EX [EX [~ [E [true U ~ [E [true U ~ [p15<=p23]]]]]]]]

abstracting: (p15<=p23)
states: 12,325,460 (7)
..-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.424sec

checking: EF [[AG [~ [p6<=p3]] & [~ [8<=p21] | 13<=p21]]]
normalized: E [true U [[13<=p21 | ~ [8<=p21]] & ~ [E [true U p6<=p3]]]]

abstracting: (p6<=p3)
states: 9,906,869 (6)
abstracting: (8<=p21)
states: 3,569,483 (6)
abstracting: (13<=p21)
states: 209,518 (5)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

checking: AG [EX [AG [[p1<=p9 | p4<=p24]]]]
normalized: ~ [E [true U ~ [EX [~ [E [true U ~ [[p1<=p9 | p4<=p24]]]]]]]]

abstracting: (p4<=p24)
states: 7,245,861 (6)
abstracting: (p1<=p9)
states: 9,906,869 (6)
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.406sec

checking: EX [[AF [~ [p22<=p4]] | EF [EG [p12<=p5]]]]
normalized: EX [[E [true U EG [p12<=p5]] | ~ [EG [p22<=p4]]]]

abstracting: (p22<=p4)
states: 7,245,861 (6)
..................................................................................................................................
EG iterations: 130
abstracting: (p12<=p5)
states: 11,483,444 (7)
.....................................................................
EG iterations: 69
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.286sec

checking: EF [AG [[[~ [p2<=1] | EF [AG [p16<=p8]]] & [p3<=1 | EF [1<=p18]]]]]
normalized: E [true U ~ [E [true U ~ [[[p3<=1 | E [true U 1<=p18]] & [E [true U ~ [E [true U ~ [p16<=p8]]]] | ~ [p2<=1]]]]]]]

abstracting: (p2<=1)
states: 11,865,065 (7)
abstracting: (p16<=p8)
states: 11,428,675 (7)
abstracting: (1<=p18)
states: 3,075,776 (6)
abstracting: (p3<=1)
states: 11,865,065 (7)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.339sec

checking: EF [[~ [E [13<=p0 U 13<=p0]] | EF [EG [[[2<=p20 | p10<=p16] & [p15<=p9 | p7<=8]]]]]]
normalized: E [true U [E [true U EG [[[p15<=p9 | p7<=8] & [2<=p20 | p10<=p16]]]] | ~ [E [13<=p0 U 13<=p0]]]]

abstracting: (13<=p0)
states: 907,702 (5)
abstracting: (13<=p0)
states: 907,702 (5)
abstracting: (p10<=p16)
states: 10,030,629 (7)
abstracting: (2<=p20)
states: 597,108 (5)
abstracting: (p7<=8)
states: 12,315,837 (7)
abstracting: (p15<=p9)
states: 8,909,972 (6)
..............................................................
EG iterations: 62
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.606sec

checking: AF [[EG [1<=p10] & [AG [EX [~ [2<=p20]]] & E [AG [[EF [p16<=p1] & 1<=p0]] U [EF [p0<=p6] & ~ [EX [p1<=p3]]]]]]]
normalized: ~ [EG [~ [[[E [~ [E [true U ~ [[1<=p0 & E [true U p16<=p1]]]]] U [~ [EX [p1<=p3]] & E [true U p0<=p6]]] & ~ [E [true U ~ [EX [~ [2<=p20]]]]]] & EG [1<=p10]]]]]

abstracting: (1<=p10)
states: 2,952,016 (6)
.
EG iterations: 1
abstracting: (2<=p20)
states: 597,108 (5)
.abstracting: (p0<=p6)
states: 88,087 (4)
abstracting: (p1<=p3)
states: 9,906,869 (6)
.abstracting: (p16<=p1)
states: 9,906,869 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)

EG iterations: 0
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.424sec

checking: AG [[~ [E [[AG [15<=p4] | [p20<=p15 | ~ [3<=p10]]] U EF [~ [6<=p4]]]] | AG [[AF [1<=p10] | [EX [4<=p2] | [~ [p11<=2] & ~ [p0<=8]]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[[[~ [p0<=8] & ~ [p11<=2]] | EX [4<=p2]] | ~ [EG [~ [1<=p10]]]]]]] | ~ [E [[[p20<=p15 | ~ [3<=p10]] | ~ [E [true U ~ [15<=p4]]]] U E [true U ~ [6<=p4]]]]]]]]

abstracting: (6<=p4)
states: 1,030,161 (6)
abstracting: (15<=p4)
states: 18
abstracting: (3<=p10)
states: 58,072 (4)
abstracting: (p20<=p15)
states: 10,106,925 (7)
abstracting: (1<=p10)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (4<=p2)
states: 6,188 (3)
.abstracting: (p11<=2)
states: 12,379,349 (7)
abstracting: (p0<=8)
states: 6,970,522 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.971sec

checking: [EF [[~ [p24<=p6] | [[p13<=1 | 6<=p12] & [AF [p23<=p17] & AX [1<=0]]]]] & A [A [AX [AX [1<=0]] U [[~ [[14<=p16 | p5<=14]] | p20<=p0] & 1<=p3]] U A [AX [1<=0] U EF [3<=p5]]]]
normalized: [[~ [EG [~ [[~ [EG [~ [E [true U 3<=p5]]]] & ~ [E [~ [E [true U 3<=p5]] U [EX [~ [1<=0]] & ~ [E [true U 3<=p5]]]]]]]]] & ~ [E [~ [[~ [EG [~ [E [true U 3<=p5]]]] & ~ [E [~ [E [true U 3<=p5]] U [EX [~ [1<=0]] & ~ [E [true U 3<=p5]]]]]]] U [~ [[~ [EG [~ [[1<=p3 & [p20<=p0 | ~ [[14<=p16 | p5<=14]]]]]]] & ~ [E [~ [[1<=p3 & [p20<=p0 | ~ [[14<=p16 | p5<=14]]]]] U [EX [EX [~ [1<=0]]] & ~ [[1<=p3 & [p20<=p0 | ~ [[14<=p16 | p5<=14]]]]]]]]]] & ~ [[~ [EG [~ [E [true U 3<=p5]]]] & ~ [E [~ [E [true U 3<=p5]] U [EX [~ [1<=0]] & ~ [E [true U 3<=p5]]]]]]]]]]] & E [true U [[[~ [EX [~ [1<=0]]] & ~ [EG [~ [p23<=p17]]]] & [p13<=1 | 6<=p12]] | ~ [p24<=p6]]]]

abstracting: (p24<=p6)
states: 4,353,751 (6)
abstracting: (6<=p12)
states: 0
abstracting: (p13<=1)
states: 11,926,945 (7)
abstracting: (p23<=p17)
states: 479,129 (5)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (3<=p5)
states: 4,179,280 (6)
abstracting: (1<=0)
states: 0
.abstracting: (3<=p5)
states: 4,179,280 (6)
abstracting: (3<=p5)
states: 4,179,280 (6)
.
EG iterations: 1
abstracting: (p5<=14)
states: 12,462,155 (7)
abstracting: (14<=p16)
states: 0
abstracting: (p20<=p0)
states: 12,462,173 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
abstracting: (1<=0)
states: 0
..abstracting: (p5<=14)
states: 12,462,155 (7)
abstracting: (14<=p16)
states: 0
abstracting: (p20<=p0)
states: 12,462,173 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
abstracting: (p5<=14)
states: 12,462,155 (7)
abstracting: (14<=p16)
states: 0
abstracting: (p20<=p0)
states: 12,462,173 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
....................................................................................................................................................................................................
EG iterations: 196
abstracting: (3<=p5)
states: 4,179,280 (6)
abstracting: (1<=0)
states: 0
.abstracting: (3<=p5)
states: 4,179,280 (6)
abstracting: (3<=p5)
states: 4,179,280 (6)
.
EG iterations: 1
abstracting: (3<=p5)
states: 4,179,280 (6)
abstracting: (1<=0)
states: 0
.abstracting: (3<=p5)
states: 4,179,280 (6)
abstracting: (3<=p5)
states: 4,179,280 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.924sec

totally nodes used: 2685085 (2.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11073787 9151099 20224886
used/not used/entry size/cache size: 10267569 56841295 16 1024MB
basic ops cache: hits/miss/sum: 2288176 2238509 4526685
used/not used/entry size/cache size: 3019926 13757290 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: 275528 186054 461582
used/not used/entry size/cache size: 183922 8204686 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 64715480
1 2210200
2 150411
3 20287
4 5452
5 1101
6 731
7 584
8 536
9 1486
>= 10 2596

Total processing time: 0m15.809sec


BK_STOP 1678333917290

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


iterations count:1752 (97), effective:370 (20)

initing FirstDep: 0m 0.000sec


iterations count:990 (55), effective:235 (13)

iterations count:105 (5), effective:41 (2)

iterations count:614 (34), effective:149 (8)

iterations count:42 (2), effective:4 (0)

iterations count:320 (17), effective:55 (3)

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

iterations count:119 (6), effective:24 (1)

iterations count:637 (35), effective:142 (7)

iterations count:102 (5), effective:19 (1)

iterations count:45 (2), effective:3 (0)

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

iterations count:185 (10), effective:44 (2)

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

iterations count:255 (14), effective:51 (2)

iterations count:824 (45), effective:190 (10)

iterations count:30 (1), effective:4 (0)

iterations count:812 (45), effective:180 (10)

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

iterations count:40 (2), effective:11 (0)

iterations count:22 (1), effective:2 (0)

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

iterations count:131 (7), effective:27 (1)

iterations count:230 (12), effective:49 (2)

iterations count:230 (12), effective:49 (2)

iterations count:230 (12), effective:49 (2)

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

iterations count:230 (12), effective:49 (2)

iterations count:230 (12), effective:49 (2)

iterations count:230 (12), effective:49 (2)

iterations count:230 (12), effective:49 (2)

iterations count:230 (12), effective:49 (2)

iterations count:230 (12), effective:49 (2)

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

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