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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 119M
-rw-r--r-- 1 mcc users 1.6M Apr 12 12:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9M Apr 12 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 10:25 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 698K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7M Apr 12 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 12 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7M Apr 12 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40M Apr 12 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 144K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 345K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.3M 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-PT-AN16-CTLCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN16-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717081361606

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:02:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 15:02:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:02:43] [INFO ] Load time of PNML (sax parser for PT used): 451 ms
[2024-05-30 15:02:43] [INFO ] Transformed 4864 places.
[2024-05-30 15:02:43] [INFO ] Transformed 4096 transitions.
[2024-05-30 15:02:43] [INFO ] Found NUPN structural information;
[2024-05-30 15:02:43] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 656 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 306 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 82 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-30 15:02:45] [INFO ] Computed 768 invariants in 98 ms
[2024-05-30 15:02:47] [INFO ] Implicit Places using invariants in 2490 ms returned []
[2024-05-30 15:02:47] [INFO ] Invariant cache hit.
[2024-05-30 15:02:53] [INFO ] Implicit Places using invariants and state equation in 6434 ms returned []
Implicit Place search using SMT with State Equation took 9330 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Finished structural reductions in LTL mode , in 1 iterations and 9442 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2024-05-30 15:02:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 15:02:55] [INFO ] Flatten gal took : 719 ms
FORMULA Sudoku-PT-AN16-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 15:02:56] [INFO ] Flatten gal took : 351 ms
[2024-05-30 15:02:58] [INFO ] Input system was already deterministic with 4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 47826 ms. (0 steps per ms) remains 10/65 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3227 ms. (12 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16601 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9604 ms. (4 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2429 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9144 ms. (4 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1478 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1368 ms. (29 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1456 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2319 ms. (17 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1032 ms. (38 steps per ms) remains 10/10 properties
[2024-05-30 15:03:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4864 variables, 4864/4864 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 5632 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5015 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4864 variables, 4864/4864 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 5632 constraints, problems are : Problem set: 5 solved, 5 unsolved in 5013 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13766ms problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 771 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 771 are kept as prefixes of interest. Removing 4093 places using SCC suffix rule.12 ms
Discarding 4093 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 142 ms. Remains 771 /4864 variables (removed 4093) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 771/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 26123 ms. (1 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1393 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1443 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1485 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2222 ms. (17 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 937 ms. (42 steps per ms) remains 5/5 properties
Probabilistic random walk after 237791 steps, saw 237723 distinct states, run finished after 24043 ms. (steps per millisecond=9 ) properties seen :0
// Phase 1: matrix 4096 rows 771 cols
[2024-05-30 15:04:11] [INFO ] Computed 47 invariants in 1101 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 771/771 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/771 variables, 47/818 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/818 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4096/4867 variables, 771/1589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4867 variables, 0/1589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/4867 variables, 0/1589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4867/4867 variables, and 1589 constraints, problems are : Problem set: 1 solved, 4 unsolved in 29855 ms.
Refiners :[Domain max(s): 771/771 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 771/771 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 515/515 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 256/771 variables, 41/562 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 256/818 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 0/818 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4096/4867 variables, 771/1589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4867 variables, 1/1590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4867 variables, 0/1590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4867/4867 variables, and 1590 constraints, problems are : Problem set: 1 solved, 4 unsolved in 45017 ms.
Refiners :[Domain max(s): 771/771 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 771/771 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 76183ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 515 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 4096/4096 transitions.
Applied a total of 0 rules in 84 ms. Remains 771 /771 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 771/771 places, 4096/4096 transitions.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-PT-AN16-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 15:05:27] [INFO ] Flatten gal took : 313 ms
[2024-05-30 15:05:27] [INFO ] Flatten gal took : 251 ms
[2024-05-30 15:05:28] [INFO ] Input system was already deterministic with 4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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-PT-AN16-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 24 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:29] [INFO ] Flatten gal took : 149 ms
[2024-05-30 15:05:29] [INFO ] Flatten gal took : 200 ms
[2024-05-30 15:05:29] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 271 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:30] [INFO ] Flatten gal took : 143 ms
[2024-05-30 15:05:30] [INFO ] Flatten gal took : 159 ms
[2024-05-30 15:05:30] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 54 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:30] [INFO ] Flatten gal took : 140 ms
[2024-05-30 15:05:31] [INFO ] Flatten gal took : 157 ms
[2024-05-30 15:05:31] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 102 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 118 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:31] [INFO ] Flatten gal took : 268 ms
[2024-05-30 15:05:31] [INFO ] Flatten gal took : 157 ms
[2024-05-30 15:05:32] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 15 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:32] [INFO ] Flatten gal took : 136 ms
[2024-05-30 15:05:32] [INFO ] Flatten gal took : 149 ms
[2024-05-30 15:05:32] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4089 places and 0 transitions.
Iterating post reduction 0 with 4089 rules applied. Total rules applied 4089 place count 775 transition count 4096
Applied a total of 4089 rules in 242 ms. Remains 775 /4864 variables (removed 4089) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 775/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:33] [INFO ] Flatten gal took : 203 ms
[2024-05-30 15:05:33] [INFO ] Flatten gal took : 121 ms
[2024-05-30 15:05:33] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4092 places and 0 transitions.
Iterating post reduction 0 with 4092 rules applied. Total rules applied 4092 place count 772 transition count 4096
Applied a total of 4092 rules in 131 ms. Remains 772 /4864 variables (removed 4092) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 772/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:33] [INFO ] Flatten gal took : 146 ms
[2024-05-30 15:05:33] [INFO ] Flatten gal took : 134 ms
[2024-05-30 15:05:34] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4078 places and 0 transitions.
Iterating post reduction 0 with 4078 rules applied. Total rules applied 4078 place count 786 transition count 4096
Applied a total of 4078 rules in 116 ms. Remains 786 /4864 variables (removed 4078) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 786/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:34] [INFO ] Flatten gal took : 110 ms
[2024-05-30 15:05:34] [INFO ] Flatten gal took : 118 ms
[2024-05-30 15:05:34] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4088 places and 0 transitions.
Iterating post reduction 0 with 4088 rules applied. Total rules applied 4088 place count 776 transition count 4096
Applied a total of 4088 rules in 116 ms. Remains 776 /4864 variables (removed 4088) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 776/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:34] [INFO ] Flatten gal took : 104 ms
[2024-05-30 15:05:35] [INFO ] Flatten gal took : 117 ms
[2024-05-30 15:05:35] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 649 are kept as prefixes of interest. Removing 4215 places using SCC suffix rule.9 ms
Discarding 4215 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 268 ms. Remains 649 /4864 variables (removed 4215) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 269 ms. Remains : 649/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:35] [INFO ] Flatten gal took : 129 ms
[2024-05-30 15:05:35] [INFO ] Flatten gal took : 99 ms
[2024-05-30 15:05:35] [INFO ] Input system was already deterministic with 4096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4095 places and 0 transitions.
Iterating post reduction 0 with 4095 rules applied. Total rules applied 4095 place count 769 transition count 4096
Applied a total of 4095 rules in 135 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 769/4864 places, 4096/4096 transitions.
[2024-05-30 15:05:36] [INFO ] Flatten gal took : 206 ms
[2024-05-30 15:05:36] [INFO ] Flatten gal took : 113 ms
[2024-05-30 15:05:36] [INFO ] Input system was already deterministic with 4096 transitions.
[2024-05-30 15:05:36] [INFO ] Flatten gal took : 162 ms
[2024-05-30 15:05:37] [INFO ] Flatten gal took : 167 ms
[2024-05-30 15:05:37] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 13 ms.
[2024-05-30 15:05:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 22 ms.
Total runtime 174619 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-PT-AN16

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: 4864
TRANSITIONS: 4096
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.105s, Sys 0.004s]


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


----------------------------------------------------------------------
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: 578
MODEL NAME: /home/mcc/execution/414/model
4864 places, 4096 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717083089142

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

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

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