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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 08:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:45 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.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 26 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 08:52 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-AN07-CTLCardinality-00
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-01
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-02
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-03
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-04
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-05
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-06
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-07
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-08
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-09
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-10
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-11
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-12
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-13
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-14
FORMULA_NAME Sudoku-COL-AN07-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679173814934

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-AN07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 21:10:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 21:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:10:16] [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 21:10:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 21:10:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 604 ms
[2023-03-18 21:10:17] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
FORMULA Sudoku-COL-AN07-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:10:17] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 21:10:17] [INFO ] Skeletonized 15 HLPN properties in 3 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 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 10046 steps, including 196 resets, run finished after 76 ms. (steps per millisecond=132 ) properties (out of 63) seen :29
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=169 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=113 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=101 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=113 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=113 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=78 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1019 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 21:10:17] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-18 21:10:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 21:10:17] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :24 sat :0 real:10
[2023-03-18 21:10:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 21:10:17] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :34 sat :0
Fused 34 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 34 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN07-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:10:17] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-18 21:10:17] [INFO ] Flatten gal took : 12 ms
[2023-03-18 21:10:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN07-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:10:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN07-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:10:17] [INFO ] Flatten gal took : 1 ms
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2023-03-18 21:10:17] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 17 ms.
[2023-03-18 21:10:17] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2023-03-18 21:10:17] [INFO ] Computed 147 place invariants in 8 ms
[2023-03-18 21:10:18] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-18 21:10:18] [INFO ] Invariant cache hit.
[2023-03-18 21:10:18] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-18 21:10:18] [INFO ] Invariant cache hit.
[2023-03-18 21:10:18] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 490 out of 490 places after structural reductions.
[2023-03-18 21:10:18] [INFO ] Flatten gal took : 50 ms
[2023-03-18 21:10:18] [INFO ] Flatten gal took : 39 ms
[2023-03-18 21:10:18] [INFO ] Input system was already deterministic with 343 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 765 ms. (steps per millisecond=13 ) properties (out of 31) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 21:10:20] [INFO ] Invariant cache hit.
[2023-03-18 21:10:21] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 21:10:21] [INFO ] [Nat]Absence check using 147 positive place invariants in 24 ms returned sat
[2023-03-18 21:10:22] [INFO ] After 635ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :1
[2023-03-18 21:10:22] [INFO ] After 1045ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :1
Attempting to minimize the solution found.
Minimization took 443 ms.
[2023-03-18 21:10:22] [INFO ] After 1770ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :1
Fused 14 Parikh solutions to 1 different solutions.
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 13 atomic propositions for a total of 7 simplifications.
[2023-03-18 21:10:22] [INFO ] Flatten gal took : 30 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 31 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 490/490 places, 343/343 transitions.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 44 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 39 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 490/490 places, 343/343 transitions.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 18 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 19 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 11 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 490/490 places, 343/343 transitions.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 17 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 17 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 3 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 490/490 places, 343/343 transitions.
[2023-03-18 21:10:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 17 ms
FORMULA Sudoku-COL-AN07-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 16 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
Support contains 0 out of 490 places (down from 441) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.3 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 147/490 places, 343/343 transitions.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 12 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 12 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 11 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 490/490 places, 343/343 transitions.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 15 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 16 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 11 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 490/490 places, 343/343 transitions.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 14 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 18 ms
[2023-03-18 21:10:23] [INFO ] Input system was already deterministic with 343 transitions.
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 17 ms
[2023-03-18 21:10:23] [INFO ] Flatten gal took : 16 ms
[2023-03-18 21:10:23] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-18 21:10:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 343 transitions and 1372 arcs took 2 ms.
Total runtime 7471 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: 490 NrTr: 343 NrArc: 1372)

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

net check time: 0m 0.000sec

init dd package: 0m 2.779sec


before gc: list nodes free: 988792

after gc: idd nodes used:61288382, unused:2711618; list nodes free:13114484

RS generation: 53m39.030sec


-> last computed set: #nodes 61287895 (6.1e+07) #states 26,673,073,979 (10)


CANNOT_COMPUTE


BK_STOP 1679177104652

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

idd.cc:820: DD Exception: No free nodes

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-AN07"
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-AN07, 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-167912708100049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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