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-167912708100001.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 Sudoku-COL-AN01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708100001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.7K Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 09:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 09:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN01-CTLCardinality-00
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-01
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-02
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-03
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-04
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-05
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-06
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-07
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-08
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-09
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-10
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-11
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-12
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-13
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-14
FORMULA_NAME Sudoku-COL-AN01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679170031428

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=Sudoku-COL-AN01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:07:14] [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-18 20:07:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:07:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 442 ms
[2023-03-18 20:07:15] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4 PT places and 1.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
FORMULA Sudoku-COL-AN01-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:07:15] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 20:07:15] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
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 10000 steps, including 5000 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 55) seen :6
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 20:07:16] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 20:07:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:07:17] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :43 sat :0 real:6
[2023-03-18 20:07:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:07:17] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :49 sat :0
Fused 49 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 49 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN01-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:07:17] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-18 20:07:17] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN01-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:07:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:17] [INFO ] Unfolded HLPN to a Petri net with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 20:07:17] [INFO ] Unfolded 3 HLPN properties in 1 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 4 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 20:07:17] [INFO ] Invariant cache hit.
[2023-03-18 20:07:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:07:17] [INFO ] Invariant cache hit.
[2023-03-18 20:07:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 20:07:17] [INFO ] Invariant cache hit.
[2023-03-18 20:07:17] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 4/4 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-18 20:07:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:17] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 20:07:19] [INFO ] Invariant cache hit.
[2023-03-18 20:07:19] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-18 20:07:19] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:5
[2023-03-18 20:07:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:07:19] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 14 atomic propositions for a total of 3 simplifications.
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:19] [INFO ] Input system was already deterministic with 1 transitions.
Support contains 3 out of 4 places (down from 4) after GAL structural reductions.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
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 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Applied a total of 3 rules in 1 ms. Remains 1 /4 variables (removed 3) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 1/4 places, 1/1 transitions.
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:19] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Applied a total of 3 rules in 0 ms. Remains 1 /4 variables (removed 3) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 1/4 places, 1/1 transitions.
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:19] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 3/4 places, 1/1 transitions.
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:19] [INFO ] Input system was already deterministic with 1 transitions.
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-18 20:07:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 1 transitions and 4 arcs took 0 ms.
Total runtime 4566 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: 4 NrTr: 1 NrArc: 4)

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

net check time: 0m 0.000sec

init dd package: 0m 2.702sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 7 (7.0e+00) #states 2



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

checking: A [AX [1<=0] U EX [0<=0]]
normalized: [~ [EG [~ [EX [0<=0]]]] & ~ [E [~ [EX [0<=0]] U [EX [~ [1<=0]] & ~ [EX [0<=0]]]]]]

abstracting: (0<=0)
states: 2
.abstracting: (1<=0)
states: 0
.abstracting: (0<=0)
states: 2
.abstracting: (0<=0)
states: 2
..
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-COL-AN01-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

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

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

FORMULA Sudoku-COL-AN01-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AF [[AX [1<=0] | [p2<=p1 | 76<=p3]]]]
normalized: EG [~ [EG [~ [[[p2<=p1 | 76<=p3] | ~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (76<=p3)
states: 0
abstracting: (p2<=p1)
states: 1
..
EG iterations: 2

EG iterations: 0
-> the formula is TRUE

FORMULA Sudoku-COL-AN01-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 23 (2.3e+01)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8 6 14
used/not used/entry size/cache size: 10 67108854 16 1024MB
basic ops cache: hits/miss/sum: 19 22 41
used/not used/entry size/cache size: 49 16777167 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: 4 8 12
used/not used/entry size/cache size: 8 8388600 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 67108843
1 19
2 2
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.237sec


BK_STOP 1679170044920

--------------------
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:2 (2), effective:1 (1)

initing FirstDep: 0m 0.000sec

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="Sudoku-COL-AN01"
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 Sudoku-COL-AN01, 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-167912708100001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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