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

About the Execution of Marcie+red for UtilityControlRoom-COL-Z2T3N04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.184 11793.00 17891.00 611.30 TFFTTFFFFFTTTFTF 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.r490-tall-167912709300953.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 UtilityControlRoom-COL-Z2T3N04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709300953
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.4K Feb 26 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 14:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29K 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 UtilityControlRoom-COL-Z2T3N04-CTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679358678928

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=UtilityControlRoom-COL-Z2T3N04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 00:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:31:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-21 00:31:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 00:31:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 421 ms
[2023-03-21 00:31:21] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 72 PT places and 108.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2023-03-21 00:31:21] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 4 ms.
[2023-03-21 00:31:21] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 87) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) 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 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) 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 65) seen :0
Running SMT prover for 65 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-03-21 00:31:22] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-21 00:31:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-21 00:31:22] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:59
[2023-03-21 00:31:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-21 00:31:22] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :65 sat :0
Fused 65 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 65 atomic propositions for a total of 16 simplifications.
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 00:31:23] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-21 00:31:23] [INFO ] Flatten gal took : 14 ms
[2023-03-21 00:31:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 00:31:23] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(4), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2023-03-21 00:31:23] [INFO ] Unfolded HLPN to a Petri net with 72 places and 108 transitions 340 arcs in 13 ms.
[2023-03-21 00:31:23] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Support contains 72 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 72 /72 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 72 cols
[2023-03-21 00:31:23] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-21 00:31:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-21 00:31:23] [INFO ] Invariant cache hit.
[2023-03-21 00:31:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-21 00:31:23] [INFO ] Invariant cache hit.
[2023-03-21 00:31:23] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 72/72 places, 92/92 transitions.
Support contains 72 out of 72 places after structural reductions.
[2023-03-21 00:31:23] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:31:23] [INFO ] Flatten gal took : 9 ms
[2023-03-21 00:31:23] [INFO ] Input system was already deterministic with 92 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 34) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-21 00:31:23] [INFO ] Invariant cache hit.
[2023-03-21 00:31:23] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-21 00:31:23] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-21 00:31:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 00:31:24] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :0
Fused 21 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 21 atomic propositions for a total of 7 simplifications.
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:31:24] [INFO ] Input system was already deterministic with 92 transitions.
Support contains 54 out of 72 places (down from 58) after GAL structural reductions.
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 56 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 56 transition count 60
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 56 place count 48 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 47 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 47 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 43 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 43 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 39 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 39 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 35 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 35 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 35 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 86 place count 35 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 94 place count 31 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 102 place count 27 transition count 24
Applied a total of 102 rules in 18 ms. Remains 27 /72 variables (removed 45) and now considering 24/92 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 27/72 places, 24/92 transitions.
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-21 00:31:24] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 56 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 56 transition count 60
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 56 place count 48 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 47 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 47 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 43 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 43 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 39 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 39 transition count 40
Applied a total of 74 rules in 7 ms. Remains 39 /72 variables (removed 33) and now considering 40/92 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 39/72 places, 40/92 transitions.
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:31:24] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 64 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 64 transition count 84
Applied a total of 16 rules in 2 ms. Remains 64 /72 variables (removed 8) and now considering 84/92 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/72 places, 84/92 transitions.
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:31:24] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 64 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 64 transition count 84
Applied a total of 16 rules in 3 ms. Remains 64 /72 variables (removed 8) and now considering 84/92 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/72 places, 84/92 transitions.
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:31:24] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 72/72 places, 92/92 transitions.
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:31:24] [INFO ] Input system was already deterministic with 92 transitions.
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 4 ms
[2023-03-21 00:31:24] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:31:24] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-21 00:31:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 92 transitions and 276 arcs took 1 ms.
Total runtime 3181 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: 72 NrTr: 92 NrArc: 276)

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

net check time: 0m 0.000sec

init dd package: 0m 2.721sec


RS generation: 0m 0.053sec


-> reachability set: #nodes 1524 (1.5e+03) #states 208,341 (5)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

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

FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

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

FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [p50<=sum(p55, p54, p53, p52)]
normalized: ~ [EG [~ [p50<=sum(p55, p54, p53, p52)]]]

abstracting: (p50<=sum(p55, p54, p53, p52))
states: 52,374 (4)
................
EG iterations: 16
-> the formula is FALSE

FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.192sec

checking: EF [~ [E [p50<=p51 U sum(p13, p12, p11, p10, p9, p8, p7, p6)<=sum(p49, p48, p47, p46)]]]
normalized: E [true U ~ [E [p50<=p51 U sum(p13, p12, p11, p10, p9, p8, p7, p6)<=sum(p49, p48, p47, p46)]]]

abstracting: (sum(p13, p12, p11, p10, p9, p8, p7, p6)<=sum(p49, p48, p47, p46))
states: 94,677 (4)
abstracting: (p50<=p51)
states: 207,228 (5)
-> the formula is TRUE

FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.157sec

checking: [AF [EX [0<=0]] | [A [sum(p13, p12, p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2) U sum(p55, p54, p53, p52)<=sum(p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22)] & EF [[AX [1<=0] & AG [~ [sum(p45, p44, p43, p42, p41, p40, p39, p38)<=sum(p21, p20, p19, p18, p17, p16, p15, p14)]]]]]]
normalized: [[E [true U [~ [E [true U sum(p45, p44, p43, p42, p41, p40, p39, p38)<=sum(p21, p20, p19, p18, p17, p16, p15, p14)]] & ~ [EX [~ [1<=0]]]]] & [~ [EG [~ [sum(p55, p54, p53, p52)<=sum(p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22)]]] & ~ [E [~ [sum(p55, p54, p53, p52)<=sum(p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22)] U [~ [sum(p13, p12, p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2)] & ~ [sum(p55, p54, p53, p52)<=sum(p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22)]]]]]] | ~ [EG [~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 208,341 (5)
..
EG iterations: 1
abstracting: (sum(p55, p54, p53, p52)<=sum(p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22))
states: 180,075 (5)
abstracting: (sum(p13, p12, p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2))
states: 68,709 (4)
abstracting: (sum(p55, p54, p53, p52)<=sum(p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22))
states: 180,075 (5)
abstracting: (sum(p55, p54, p53, p52)<=sum(p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22))
states: 180,075 (5)
.....
EG iterations: 5
abstracting: (1<=0)
states: 0
.abstracting: (sum(p45, p44, p43, p42, p41, p40, p39, p38)<=sum(p21, p20, p19, p18, p17, p16, p15, p14))
states: 155,701 (5)
-> the formula is TRUE

FORMULA UtilityControlRoom-COL-Z2T3N04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.719sec

totally nodes used: 354494 (3.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 572231 1710574 2282805
used/not used/entry size/cache size: 2016518 65092346 16 1024MB
basic ops cache: hits/miss/sum: 56161 153660 209821
used/not used/entry size/cache size: 301629 16475587 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 1122347 1122347
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 2963 9135 12098
used/not used/entry size/cache size: 9125 8379483 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 66776957
1 312108
2 17888
3 1688
4 151
5 18
6 7
7 18
8 9
9 0
>= 10 20

Total processing time: 0m 5.504sec


BK_STOP 1679358690721

--------------------
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:2688 (29), effective:139 (1)

initing FirstDep: 0m 0.000sec


iterations count:1262 (13), effective:112 (1)

iterations count:1123 (12), effective:100 (1)

iterations count:608 (6), effective:50 (0)

iterations count:431 (4), effective:46 (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="UtilityControlRoom-COL-Z2T3N04"
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 UtilityControlRoom-COL-Z2T3N04, 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 r490-tall-167912709300953"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T3N04.tgz
mv UtilityControlRoom-COL-Z2T3N04 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 ;