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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 11:30 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 3.6K 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.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 11:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 11:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 11:36 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-AN05-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN05-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717025721131

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-AN05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 23:35:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 23:35:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:35:22] [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:35:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 23:35:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 536 ms
[2024-05-29 23:35:23] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:35:23] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-29 23:35:23] [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).
AF dead knowledge conclusive for 2 formulas.
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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).
RANDOM walk for 40064 steps (1480 resets) in 582 ms. (68 steps per ms) remains 41/56 properties
BEST_FIRST walk for 4000 steps (148 resets) in 53 ms. (74 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 61 ms. (64 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 64 ms. (61 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 56 ms. (70 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 81 ms. (48 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 46 ms. (85 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 72 ms. (54 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 22 ms. (173 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 22 ms. (173 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (148 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-29 23:35:23] [INFO ] Computed 3 invariants in 5 ms
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 AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 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 AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 41 solved, 0 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 41 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 41 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:35:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 23:35:23] [INFO ] Flatten gal took : 28 ms
[2024-05-29 23:35:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:35:23] [INFO ] Flatten gal took : 0 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2024-05-29 23:35:23] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 12 ms.
[2024-05-29 23:35:23] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-29 23:35:24] [INFO ] Computed 75 invariants in 14 ms
[2024-05-29 23:35:24] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-29 23:35:24] [INFO ] Invariant cache hit.
[2024-05-29 23:35:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 311 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 330 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2024-05-29 23:35:24] [INFO ] Flatten gal took : 36 ms
[2024-05-29 23:35:24] [INFO ] Flatten gal took : 26 ms
[2024-05-29 23:35:24] [INFO ] Input system was already deterministic with 125 transitions.
RANDOM walk for 40000 steps (1817 resets) in 3725 ms. (10 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
[2024-05-29 23:35:25] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 200/325 variables, and 75 constraints, problems are : Problem set: 18 solved, 0 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 18 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 18 atomic propositions for a total of 8 simplifications.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 14 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 13 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
Support contains 175 out of 200 places (down from 200) after GAL structural reductions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 3 formulas.
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 200/200 places, 125/125 transitions.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 11 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 11 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 200/200 places, 125/125 transitions.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 10 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 10 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.1 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 75/200 places, 125/125 transitions.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 8 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 11 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 75/200 places, 125/125 transitions.
[2024-05-29 23:35:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 8 ms
FORMULA Sudoku-COL-AN05-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 200/200 places, 125/125 transitions.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 9 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 12 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 200/200 places, 125/125 transitions.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 9 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 10 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.1 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 75/200 places, 125/125 transitions.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 23:35:26] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 8 ms
[2024-05-29 23:35:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 23:35:26] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-29 23:35:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 125 transitions and 500 arcs took 3 ms.
Total runtime 4084 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN05

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 530
MODEL NAME: /home/mcc/execution/410/model
200 places, 125 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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

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