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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.8K Feb 26 09:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 09:02 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.8K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 26 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 26 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 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-AN02-CTLCardinality-00
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-01
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-02
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-03
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-04
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-05
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-06
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-07
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-08
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-09
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-10
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-11
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-12
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-13
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-14
FORMULA_NAME Sudoku-COL-AN02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679170051761

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-AN02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:07:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:07:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:07:33] [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:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:07:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 404 ms
[2023-03-18 20:07:33] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
FORMULA Sudoku-COL-AN02-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:07:33] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 20:07:33] [INFO ] Skeletonized 14 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).
Remains 14 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 10001 steps, including 1666 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 45) seen :5
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 166 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Running SMT prover for 40 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 20:07:34] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 20:07:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:07:35] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :40 sat :0
Fused 40 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 40 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-AN02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:07:35] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN02-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 0 ms
Domain [N(2), N(2)] of place Rows breaks symmetries in sort N
[2023-03-18 20:07:35] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions 32 arcs in 4 ms.
[2023-03-18 20:07:35] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2023-03-18 20:07:35] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 20:07:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:07:35] [INFO ] Invariant cache hit.
[2023-03-18 20:07:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-18 20:07:35] [INFO ] Invariant cache hit.
[2023-03-18 20:07:35] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 20/20 places, 8/8 transitions.
Support contains 20 out of 20 places after structural reductions.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:07:35] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 553 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 554 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 559 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 20:07:35] [INFO ] Invariant cache hit.
[2023-03-18 20:07:35] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-18 20:07:35] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:07:35] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
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 SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 14 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 20/20 places, 8/8 transitions.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 10 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:35] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 0 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/20 places, 8/8 transitions.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 8/8 transitions.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:35] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/20 places, 8/8 transitions.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 8/8 transitions.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:35] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 20:07:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 8 transitions and 32 arcs took 1 ms.
Total runtime 2414 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: 20 NrTr: 8 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.709sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 123 (1.2e+02) #states 35



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

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

abstracting: (0<=0)
states: 35
..-> the formula is TRUE

FORMULA Sudoku-COL-AN02-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Sudoku-COL-AN02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AF [EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]]
normalized: ~ [EG [~ [EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]]]]

abstracting: (sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12))
states: 25
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-COL-AN02-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]
normalized: EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]

abstracting: (sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12))
states: 25
..
EG iterations: 2
-> the formula is TRUE

FORMULA Sudoku-COL-AN02-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AF [EX [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6, p5, p4)]]]
normalized: ~ [EX [EG [~ [EX [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6, p5, p4)]]]]]

abstracting: (sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6, p5, p4))
states: 26
...
EG iterations: 2
.-> the formula is TRUE

FORMULA Sudoku-COL-AN02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

totally nodes used: 1328 (1.3e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 320 2561 2881
used/not used/entry size/cache size: 3086 67105778 16 1024MB
basic ops cache: hits/miss/sum: 140 1533 1673
used/not used/entry size/cache size: 3042 16774174 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 8190 8190
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 47 257 304
used/not used/entry size/cache size: 257 8388351 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 67107545
1 1310
2 9
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.350sec


BK_STOP 1679170061650

--------------------
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:37 (4), effective:8 (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-AN02"
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-AN02, 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-167912708100009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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