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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 11:09 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.8K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 11:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 11:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 11:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 11:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 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 36K 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-BN04-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717051274108

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-BN04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:41:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 06:41:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:41:15] [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-30 06:41:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 06:41:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2024-05-30 06:41:15] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 128 PT places and 256.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
[2024-05-30 06:41:16] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2024-05-30 06:41:16] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 4 formulas.
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 40028 steps (2220 resets) in 959 ms. (41 steps per ms) remains 46/55 properties
BEST_FIRST walk for 4028 steps (220 resets) in 26 ms. (149 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 16 ms. (236 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 33 ms. (118 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 23 ms. (167 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 22 ms. (175 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 23 ms. (167 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 23 ms. (167 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 9 ms. (402 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 21 ms. (183 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 8 ms. (447 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 10 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 16 ms. (236 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 17 ms. (223 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 9 ms. (402 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 10 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 18 ms. (212 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 24 ms. (161 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 24 ms. (161 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 10 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 10 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 12 ms. (309 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 12 ms. (309 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 15 ms. (251 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 10 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 10 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 46/46 properties
// Phase 1: matrix 1 rows 5 cols
[2024-05-30 06:41:16] [INFO ] Computed 4 invariants in 8 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 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 AtomicPropp26 is UNSAT
Problem AtomicPropp27 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 AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
After SMT solving in domain Real declared 5/6 variables, and 4 constraints, problems are : Problem set: 46 solved, 0 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 46 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 46 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:41:17] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-30 06:41:17] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:41:17] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2024-05-30 06:41:17] [INFO ] Unfolded HLPN to a Petri net with 128 places and 64 transitions 320 arcs in 13 ms.
[2024-05-30 06:41:17] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-30 06:41:17] [INFO ] Computed 64 invariants in 10 ms
[2024-05-30 06:41:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 06:41:17] [INFO ] Invariant cache hit.
[2024-05-30 06:41:17] [INFO ] Implicit Places using invariants and state equation in 86 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 201 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2024-05-30 06:41:17] [INFO ] Flatten gal took : 19 ms
[2024-05-30 06:41:17] [INFO ] Flatten gal took : 15 ms
[2024-05-30 06:41:17] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (2862 resets) in 2679 ms. (14 steps per ms) remains 15/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
[2024-05-30 06:41:18] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 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 AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 128/192 variables, and 64 constraints, problems are : Problem set: 15 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 15 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 15 atomic propositions for a total of 6 simplifications.
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 10 ms
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 9 ms
[2024-05-30 06:41:18] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 96 out of 128 places (down from 128) after GAL structural reductions.
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 64
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-BN04-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 11 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 64/128 places, 64/64 transitions.
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 7 ms
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 6 ms
[2024-05-30 06:41:18] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 128/128 places, 64/64 transitions.
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 7 ms
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 06:41:18] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 128/128 places, 64/64 transitions.
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 7 ms
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 06:41:18] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 3 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/128 places, 64/64 transitions.
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 6 ms
[2024-05-30 06:41:18] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 06:41:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 06:41:18] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-30 06:41:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 64 transitions and 320 arcs took 2 ms.
Total runtime 3416 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-BN04

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/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: 535
MODEL NAME: /home/mcc/execution/414/model
128 places, 64 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-BN04-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-BN04-CTLCardinality-2024-06 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717051636628

--------------------
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

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

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