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.r266-smll-167863541000473.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 PermAdmissibility-COL-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541000473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-05-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679079992396

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=PermAdmissibility-COL-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 19:06:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 19:06:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 19:06:36] [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-17 19:06:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 19:06:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1013 ms
[2023-03-17 19:06:37] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
[2023-03-17 19:06:37] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 8 ms.
[2023-03-17 19:06:37] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10003 steps, including 103 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 92) seen :34
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) 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 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 57) seen :0
Running SMT prover for 57 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-17 19:06:38] [INFO ] Computed 24 place invariants in 7 ms
[2023-03-17 19:06:39] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 25 ms returned sat
[2023-03-17 19:06:39] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:49
[2023-03-17 19:06:39] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-17 19:06:39] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :57 sat :0
Fused 57 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 11 ms.
Successfully simplified 57 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-COL-05-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 19:06:39] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-17 19:06:39] [INFO ] Flatten gal took : 78 ms
[2023-03-17 19:06:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PermAdmissibility-COL-05-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 19:06:39] [INFO ] Flatten gal took : 11 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 19:06:39] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 17 ms.
[2023-03-17 19:06:39] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 38 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Applied a total of 0 rules in 12 ms. Remains 40 /40 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-17 19:06:39] [INFO ] Invariant cache hit.
[2023-03-17 19:06:39] [INFO ] Implicit Places using invariants in 69 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 39/40 places, 16/16 transitions.
Support contains 38 out of 39 places after structural reductions.
[2023-03-17 19:06:40] [INFO ] Flatten gal took : 11 ms
[2023-03-17 19:06:40] [INFO ] Flatten gal took : 10 ms
[2023-03-17 19:06:40] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10003 steps, including 103 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 54) seen :24
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 16 rows 39 cols
[2023-03-17 19:06:40] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 19:06:40] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 14 ms returned sat
[2023-03-17 19:06:40] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:24
[2023-03-17 19:06:41] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 19 ms returned sat
[2023-03-17 19:06:41] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :30 sat :0
Fused 30 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 30 atomic propositions for a total of 8 simplifications.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 7 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 7 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 31 out of 39 places (down from 32) after GAL structural reductions.
FORMULA PermAdmissibility-COL-05-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 31 transition count 16
Applied a total of 8 rules in 2 ms. Remains 31 /39 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/39 places, 16/16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 5 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 6 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 30 transition count 16
Applied a total of 9 rules in 2 ms. Remains 30 /39 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/39 places, 16/16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 5 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 5 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 30 transition count 16
Applied a total of 9 rules in 2 ms. Remains 30 /39 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/39 places, 16/16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 5 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 30 transition count 16
Applied a total of 9 rules in 1 ms. Remains 30 /39 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/39 places, 16/16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 29 transition count 16
Applied a total of 10 rules in 2 ms. Remains 29 /39 variables (removed 10) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 29/39 places, 16/16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 30 transition count 16
Applied a total of 9 rules in 2 ms. Remains 30 /39 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/39 places, 16/16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 31 transition count 16
Applied a total of 8 rules in 2 ms. Remains 31 /39 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/39 places, 16/16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 3 ms
[2023-03-17 19:06:41] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 5 ms
[2023-03-17 19:06:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 19:06:41] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-17 19:06:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 16 transitions and 80 arcs took 1 ms.
Total runtime 5573 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: 39 NrTr: 16 NrArc: 80)

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

net check time: 0m 0.000sec

init dd package: 0m 3.664sec


RS generation: 0m 0.016sec


-> reachability set: #nodes 4194 (4.2e+03) #states 20,349 (4)



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

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

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

FORMULA PermAdmissibility-COL-05-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: [EG [p19<=p29] | EX [p9<=p31]]
normalized: [EG [p19<=p29] | EX [p9<=p31]]

abstracting: (p9<=p31)
states: 18,155 (4)
.abstracting: (p19<=p29)
states: 5,060 (3)
..................
EG iterations: 18
-> the formula is FALSE

FORMULA PermAdmissibility-COL-05-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: A [AG [AX [AX [EG [p24<=p5]]]] U EX [AG [~ [[p8<=p9 | 20<=p35]]]]]
normalized: [~ [EG [~ [EX [~ [E [true U [p8<=p9 | 20<=p35]]]]]]] & ~ [E [~ [EX [~ [E [true U [p8<=p9 | 20<=p35]]]]] U [E [true U EX [EX [~ [EG [p24<=p5]]]]] & ~ [EX [~ [E [true U [p8<=p9 | 20<=p35]]]]]]]]]

abstracting: (20<=p35)
states: 0
abstracting: (p8<=p9)
states: 15,504 (4)
.abstracting: (p24<=p5)
states: 13,797 (4)
............................................................................
EG iterations: 76
..abstracting: (20<=p35)
states: 0
abstracting: (p8<=p9)
states: 15,504 (4)
.abstracting: (20<=p35)
states: 0
abstracting: (p8<=p9)
states: 15,504 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-05-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: AF [[A [~ [[[p1<=p21 | 48<=p36] & EX [0<=0]]] U ~ [p32<=p26]] | AX [1<=0]]]
normalized: ~ [EG [~ [[~ [EX [~ [1<=0]]] | [~ [EG [p32<=p26]] & ~ [E [p32<=p26 U [p32<=p26 & [EX [0<=0] & [p1<=p21 | 48<=p36]]]]]]]]]]

abstracting: (48<=p36)
states: 0
abstracting: (p1<=p21)
states: 16,336 (4)
abstracting: (0<=0)
states: 20,349 (4)
.abstracting: (p32<=p26)
states: 15,752 (4)
abstracting: (p32<=p26)
states: 15,752 (4)
abstracting: (p32<=p26)
states: 15,752 (4)
...........................................................................
EG iterations: 75
abstracting: (1<=0)
states: 0
............................................................................
EG iterations: 75
-> the formula is TRUE

FORMULA PermAdmissibility-COL-05-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

checking: EG [[[AX [~ [p10<=p31]] | EG [~ [p3<=p27]]] & [EG [AX [p34<=p21]] | AG [~ [p0<=p17]]]]]
normalized: EG [[[~ [E [true U p0<=p17]] | EG [~ [EX [~ [p34<=p21]]]]] & [EG [~ [p3<=p27]] | ~ [EX [p10<=p31]]]]]

abstracting: (p10<=p31)
states: 18,155 (4)
.abstracting: (p3<=p27)
states: 19,226 (4)
....................................................
EG iterations: 52
abstracting: (p34<=p21)
states: 10,332 (4)
...............................................................
EG iterations: 62
abstracting: (p0<=p17)
states: 19,226 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PermAdmissibility-COL-05-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: [EX [0<=0] & [AF [[[[p21<=1 | 59<=p21] & [p13<=p5 | p12<=p31]] | AG [~ [4<=p14]]]] & AX [AF [p4<=p28]]]]
normalized: [[~ [EX [EG [~ [p4<=p28]]]] & ~ [EG [~ [[~ [E [true U 4<=p14]] | [[p13<=p5 | p12<=p31] & [p21<=1 | 59<=p21]]]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 20,349 (4)
.abstracting: (59<=p21)
states: 0
abstracting: (p21<=1)
states: 19,380 (4)
abstracting: (p12<=p31)
states: 18,155 (4)
abstracting: (p13<=p5)
states: 17,524 (4)
abstracting: (4<=p14)
states: 4,970 (3)
.................................
EG iterations: 33
abstracting: (p4<=p28)
states: 5,060 (3)
......................................................................
EG iterations: 70
.-> the formula is TRUE

FORMULA PermAdmissibility-COL-05-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.218sec

checking: AF [[~ [p16<=p3] & [[~ [A [EF [p23<=p29] U AX [p4<=p11]]] | ~ [p2<=p37]] & [28<=p9 | [p22<=19 | 68<=p6]]]]]
normalized: ~ [EG [~ [[[[~ [[~ [EG [EX [~ [p4<=p11]]]] & ~ [E [EX [~ [p4<=p11]] U [EX [~ [p4<=p11]] & ~ [E [true U p23<=p29]]]]]]] | ~ [p2<=p37]] & [28<=p9 | [p22<=19 | 68<=p6]]] & ~ [p16<=p3]]]]]

abstracting: (p16<=p3)
states: 6,932 (3)
abstracting: (68<=p6)
states: 0
abstracting: (p22<=19)
states: 20,349 (4)
abstracting: (28<=p9)
states: 0
abstracting: (p2<=p37)
states: 16,336 (4)
abstracting: (p23<=p29)
states: 6,188 (3)
abstracting: (p4<=p11)
states: 5,060 (3)
.abstracting: (p4<=p11)
states: 5,060 (3)
.abstracting: (p4<=p11)
states: 5,060 (3)
.......................................................................
EG iterations: 70
.
EG iterations: 1
-> the formula is FALSE

FORMULA PermAdmissibility-COL-05-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.196sec

totally nodes used: 490486 (4.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 485160 1346198 1831358
used/not used/entry size/cache size: 1818315 65290549 16 1024MB
basic ops cache: hits/miss/sum: 119409 335608 455017
used/not used/entry size/cache size: 615308 16161908 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: 14411 25258 39669
used/not used/entry size/cache size: 25229 8363379 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 66677368
1 398898
2 22439
3 5282
4 1924
5 1088
6 515
7 435
8 182
9 125
>= 10 608

Total processing time: 0m 6.397sec


BK_STOP 1679080008966

--------------------
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:401 (25), effective:80 (5)

initing FirstDep: 0m 0.000sec


iterations count:21 (1), effective:5 (0)

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

iterations count:21 (1), effective:5 (0)

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

iterations count:21 (1), effective:5 (0)

iterations count:67 (4), effective:15 (0)

iterations count:68 (4), effective:9 (0)

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

iterations count:126 (7), effective:20 (1)

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="PermAdmissibility-COL-05"
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 PermAdmissibility-COL-05, 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 r266-smll-167863541000473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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