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.r458-smll-167912649800057.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 SmallOperatingSystem-PT-MT0256DC0064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649800057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.1K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679231756521

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=SmallOperatingSystem-PT-MT0256DC0064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:16:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:16:01] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-19 13:16:01] [INFO ] Transformed 9 places.
[2023-03-19 13:16:01] [INFO ] Transformed 8 transitions.
[2023-03-19 13:16:01] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 18 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:16:01] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 13:16:01] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-19 13:16:01] [INFO ] Invariant cache hit.
[2023-03-19 13:16:01] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-19 13:16:01] [INFO ] Invariant cache hit.
[2023-03-19 13:16:01] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:16:02] [INFO ] Flatten gal took : 27 ms
[2023-03-19 13:16:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:16:02] [INFO ] Flatten gal took : 9 ms
[2023-03-19 13:16:02] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10048 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 55) seen :30
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2023-03-19 13:16:02] [INFO ] Invariant cache hit.
[2023-03-19 13:16:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:16:03] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :24 sat :0 real:1
[2023-03-19 13:16:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:16:03] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :24 sat :1
[2023-03-19 13:16:03] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 13:16:03] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :1
Fused 25 Parikh solutions to 1 different solutions.
Finished Parikh walk after 523 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=104 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 24 atomic propositions for a total of 15 simplifications.
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:16:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 4 ms
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 14 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 260 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=86 )
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
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 5 place count 5 transition count 6
Applied a total of 5 rules in 3 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:03] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:03] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-19 13:16:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 2512 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: 9 NrTr: 8 NrArc: 27)

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

net check time: 0m 0.000sec

init dd package: 0m 3.670sec


RS generation: 0m 3.822sec


-> reachability set: #nodes 5193 (5.2e+03) #states 3,372,388,305 (9)



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

checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]

abstracting: (0<=0)
states: 3,372,388,305 (9)
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.371sec

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

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: AX [AG [51<=p6]]
normalized: ~ [EX [E [true U ~ [51<=p6]]]]

abstracting: (51<=p6)
states: 2,663,435,775 (9)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.287sec

checking: EX [~ [E [EF [~ [[23<=p5 & p2<=115]]] U EF [p2<=p5]]]]
normalized: EX [~ [E [E [true U ~ [[23<=p5 & p2<=115]]] U E [true U p2<=p5]]]]

abstracting: (p2<=p5)
states: 2,512,020,225 (9)
abstracting: (p2<=115)
states: 3,372,388,305 (9)
abstracting: (23<=p5)
states: 2,485,641,015 (9)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.674sec

checking: AF [[EF [EG [~ [p5<=149]]] & [[~ [p6<=14] | EX [0<=0]] & [~ [p3<=249] | ~ [95<=p7]]]]]
normalized: ~ [EG [~ [[[[EX [0<=0] | ~ [p6<=14]] & [~ [95<=p7] | ~ [p3<=249]]] & E [true U EG [~ [p5<=149]]]]]]]

abstracting: (p5<=149)
states: 3,255,279,027 (9)
.
EG iterations: 1
abstracting: (p3<=249)
states: 3,372,388,305 (9)
abstracting: (95<=p7)
states: 401,552,580 (8)
abstracting: (p6<=14)
states: 145,774,200 (8)
abstracting: (0<=0)
states: 3,372,388,305 (9)
..
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.854sec

checking: [AX [[~ [p8<=p3] & E [p2<=6 U p5<=28]]] & EF [~ [p7<=113]]]
normalized: [E [true U ~ [p7<=113]] & ~ [EX [~ [[E [p2<=6 U p5<=28] & ~ [p8<=p3]]]]]]

abstracting: (p8<=p3)
states: 1,715,813,649 (9)
abstracting: (p5<=28)
states: 1,093,999,335 (9)
abstracting: (p2<=6)
states: 529,895,450 (8)
.abstracting: (p7<=113)
states: 3,226,614,105 (9)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.826sec

checking: AG [AF [[EX [0<=0] & E [[p5<=p7 & p3<=p6] U 205<=p1]]]]
normalized: ~ [E [true U EG [~ [[E [[p5<=p7 & p3<=p6] U 205<=p1] & EX [0<=0]]]]]]

abstracting: (0<=0)
states: 3,372,388,305 (9)
.abstracting: (205<=p1)
states: 3,819,816 (6)
abstracting: (p3<=p6)
states: 3,152,287,281 (9)
abstracting: (p5<=p7)
states: 1,572,283,009 (9)
..
EG iterations: 2
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.645sec

checking: ~ [E [EG [p3<=p6] U [[123<=p7 & ~ [[p3<=27 & p3<=123]]] & [p3<=57 & [p7<=p8 & p3<=p5]]]]]
normalized: ~ [E [EG [p3<=p6] U [[p3<=57 & [p7<=p8 & p3<=p5]] & [123<=p7 & ~ [[p3<=27 & p3<=123]]]]]]

abstracting: (p3<=123)
states: 3,372,388,305 (9)
abstracting: (p3<=27)
states: 2,398,107,635 (9)
abstracting: (123<=p7)
states: 52,904,280 (7)
abstracting: (p3<=p5)
states: 2,610,896,145 (9)
abstracting: (p7<=p8)
states: 907,253,633 (8)
abstracting: (p3<=57)
states: 3,338,649,215 (9)
abstracting: (p3<=p6)
states: 3,152,287,281 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.278sec

checking: [AG [E [[EX [0<=0] | [p4<=p7 | [AX [p1<=130] & [126<=p6 | p5<=19]]]] U E [[122<=p1 & 52<=p2] U [p4<=p0 & 152<=p5]]]] & [EF [AG [[169<=p1 | 29<=p2]]] | [EX [0<=0] | E [EX [0<=0] U EF [[p3<=p8 | [p2<=46 & p0<=255]]]]]]]
normalized: [[[E [EX [0<=0] U E [true U [p3<=p8 | [p2<=46 & p0<=255]]]] | EX [0<=0]] | E [true U ~ [E [true U ~ [[169<=p1 | 29<=p2]]]]]] & ~ [E [true U ~ [E [[[p4<=p7 | [[126<=p6 | p5<=19] & ~ [EX [~ [p1<=130]]]]] | EX [0<=0]] U E [[122<=p1 & 52<=p2] U [p4<=p0 & 152<=p5]]]]]]]

abstracting: (152<=p5)
states: 107,720,613 (8)
abstracting: (p4<=p0)
states: 3,372,388,305 (9)
abstracting: (52<=p2)
states: 210,167,230 (8)
abstracting: (122<=p1)
states: 315,216,936 (8)
abstracting: (0<=0)
states: 3,372,388,305 (9)
.abstracting: (p1<=130)
states: 3,135,703,857 (9)
.abstracting: (p5<=19)
states: 779,385,750 (8)
abstracting: (126<=p6)
states: 147,887,025 (8)
abstracting: (p4<=p7)
states: 1,572,283,009 (9)
abstracting: (29<=p2)
states: 1,306,623,069 (9)
abstracting: (169<=p1)
states: 48,124,648 (7)
abstracting: (0<=0)
states: 3,372,388,305 (9)
.abstracting: (p0<=255)
states: 3,369,883,856 (9)
abstracting: (p2<=46)
states: 2,990,877,900 (9)
abstracting: (p3<=p8)
states: 1,715,813,649 (9)
abstracting: (0<=0)
states: 3,372,388,305 (9)
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.086sec

totally nodes used: 1450919 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 328700296 4252061 332952357
used/not used/entry size/cache size: 4321222 62787642 16 1024MB
basic ops cache: hits/miss/sum: 122050703 4897172 126947875
used/not used/entry size/cache size: 5160979 11616237 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: 7661426 102554 7763980
used/not used/entry size/cache size: 101870 8286738 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 66185062
1 825797
2 46369
3 7518
4 3542
5 2787
6 2701
7 1778
8 6804
9 9644
>= 10 16862

Total processing time: 1m 6.003sec


BK_STOP 1679231830808

--------------------
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:4168 (521), effective:1088 (136)

initing FirstDep: 0m 0.000sec


iterations count:1334 (166), effective:390 (48)

iterations count:456 (57), effective:128 (16)

iterations count:1688 (211), effective:574 (71)

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

iterations count:2408 (301), effective:750 (93)

iterations count:1350 (168), effective:498 (62)

iterations count:1946 (243), effective:570 (71)

iterations count:2828 (353), effective:957 (119)

iterations count:2101 (262), effective:634 (79)

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

iterations count:2440 (305), effective:760 (95)

iterations count:668 (83), effective:208 (26)

iterations count:25 (3), effective:17 (2)

iterations count:8 (1), effective:0 (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="SmallOperatingSystem-PT-MT0256DC0064"
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 SmallOperatingSystem-PT-MT0256DC0064, 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 r458-smll-167912649800057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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