Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530300425.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Sudoku-COL-AN03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530300425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K Apr 12 10:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 10:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 10:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 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-AN03-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717025021229

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 23:23:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 23:23:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:23:42] [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.
[2024-05-29 23:23:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 23:23:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 480 ms
[2024-05-29 23:23:42] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
[2024-05-29 23:23:42] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-29 23:23:42] [INFO ] Skeletonized 16 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).
AF dead knowledge conclusive for 1 formulas.
Remains 16 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).
RANDOM walk for 40000 steps (3636 resets) in 1167 ms. (34 steps per ms) remains 67/78 properties
BEST_FIRST walk for 4000 steps (360 resets) in 37 ms. (105 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 103 ms. (38 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 28 ms. (137 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 28 ms. (137 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 10 ms. (363 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 10 ms. (363 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 11 ms. (333 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 22 ms. (173 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 11 ms. (333 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (360 resets) in 11 ms. (333 steps per ms) remains 67/67 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-29 23:23:43] [INFO ] Computed 3 invariants in 3 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 67 solved, 0 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 67 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 67 atomic propositions for a total of 16 simplifications.
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:23:44] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2024-05-29 23:23:44] [INFO ] Flatten gal took : 11 ms
[2024-05-29 23:23:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:23:44] [INFO ] Flatten gal took : 0 ms
Domain [N(3), N(3)] of place Rows breaks symmetries in sort N
[2024-05-29 23:23:44] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions 108 arcs in 7 ms.
[2024-05-29 23:23:44] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2024-05-29 23:23:44] [INFO ] Computed 27 invariants in 3 ms
[2024-05-29 23:23:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 23:23:44] [INFO ] Invariant cache hit.
[2024-05-29 23:23:44] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 54/54 places, 27/27 transitions.
Support contains 54 out of 54 places after structural reductions.
[2024-05-29 23:23:44] [INFO ] Flatten gal took : 10 ms
[2024-05-29 23:23:44] [INFO ] Flatten gal took : 16 ms
[2024-05-29 23:23:44] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 40000 steps (4699 resets) in 2067 ms. (19 steps per ms) remains 16/21 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (44 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (41 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (41 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (42 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (41 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (41 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (43 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (43 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
[2024-05-29 23:23:45] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 54/81 variables, and 27 constraints, problems are : Problem set: 16 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 16 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 16 atomic propositions for a total of 3 simplifications.
[2024-05-29 23:23:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 23:23:45] [INFO ] Flatten gal took : 4 ms
[2024-05-29 23:23:45] [INFO ] Input system was already deterministic with 27 transitions.
Support contains 36 out of 54 places (down from 45) after GAL structural reductions.
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 27/27 transitions.
[2024-05-29 23:23:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 23:23:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 23:23:45] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-29 23:23:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 23:23:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 23:23:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-05-29 23:23:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 27 transitions and 108 arcs took 1 ms.
Total runtime 3052 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN03

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 54
TRANSITIONS: 27
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 534
MODEL NAME: /home/mcc/execution/411/model
54 places, 27 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Sudoku-COL-AN03-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717025026317

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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-AN03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Sudoku-COL-AN03, 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 r399-tall-171690530300425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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