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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.1K Apr 12 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 11:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 11:46 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:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-AN11-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN11-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717037418085

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-AN11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 02:50:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 02:50:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:50:19] [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 02:50:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 02:50:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2024-05-30 02:50:20] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
[2024-05-30 02:50:20] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 02:50:20] [INFO ] Skeletonized 16 HLPN properties in 2 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.
FORMULA Sudoku-COL-AN11-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40340 steps (324 resets) in 229 ms. (175 steps per ms) remains 13/65 properties
BEST_FIRST walk for 40340 steps (324 resets) in 74 ms. (537 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 53 ms. (747 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 111 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 77 ms. (517 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 73 ms. (545 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 70 ms. (568 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 37 ms. (1061 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 25 ms. (1551 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 38 ms. (1034 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 20 ms. (1920 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 38 ms. (1034 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 44 ms. (896 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40340 steps (324 resets) in 50 ms. (790 steps per ms) remains 13/13 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 02:50:20] [INFO ] Computed 3 invariants in 3 ms
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 11 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 2/9 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/5 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 9 constraints, problems are : Problem set: 11 solved, 2 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 11 solved, 2 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 8 ms.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
[2024-05-30 02:50:20] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:50:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 02:50:20] [INFO ] Flatten gal took : 1 ms
FORMULA Sudoku-COL-AN11-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2024-05-30 02:50:20] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 33 ms.
[2024-05-30 02:50:20] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 02:50:21] [INFO ] Computed 363 invariants in 41 ms
[2024-05-30 02:50:21] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-30 02:50:21] [INFO ] Invariant cache hit.
[2024-05-30 02:50:23] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 2261 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2024-05-30 02:50:23] [INFO ] Flatten gal took : 204 ms
[2024-05-30 02:50:24] [INFO ] Flatten gal took : 138 ms
[2024-05-30 02:50:24] [INFO ] Input system was already deterministic with 1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 12201 ms. (3 steps per ms) remains 10/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 846 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1211 ms. (33 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3409 ms. (11 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2075 ms. (19 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4033 ms. (9 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1384 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 10/10 properties
[2024-05-30 02:50:31] [INFO ] Invariant cache hit.
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1694 variables, 363/363 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1694 variables, 0/363 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 2057 constraints, problems are : Problem set: 9 solved, 1 unsolved in 2712 ms.
Refiners :[Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 363 constraints, problems are : Problem set: 9 solved, 1 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5876ms problems are : Problem set: 9 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.4 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 38 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 5137 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1284 ms. (31 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189126 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189126 steps, saw 115742 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 02:50:42] [INFO ] Computed 32 invariants in 84 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1694 variables, 363/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/1694 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 650 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1694 variables, 363/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/1694 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 985 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
[2024-05-30 02:50:44] [INFO ] Flatten gal took : 97 ms
[2024-05-30 02:50:44] [INFO ] Flatten gal took : 79 ms
[2024-05-30 02:50:45] [INFO ] Input system was already deterministic with 1331 transitions.
FORMULA Sudoku-COL-AN11-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 28 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:45] [INFO ] Flatten gal took : 56 ms
[2024-05-30 02:50:45] [INFO ] Flatten gal took : 59 ms
[2024-05-30 02:50:45] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 42 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:45] [INFO ] Flatten gal took : 40 ms
[2024-05-30 02:50:45] [INFO ] Flatten gal took : 55 ms
[2024-05-30 02:50:45] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 9 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:45] [INFO ] Flatten gal took : 39 ms
[2024-05-30 02:50:45] [INFO ] Flatten gal took : 43 ms
[2024-05-30 02:50:45] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 51 ms
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 56 ms
[2024-05-30 02:50:46] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 8 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 50 ms
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 53 ms
[2024-05-30 02:50:46] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.6 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 35 ms
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 39 ms
[2024-05-30 02:50:46] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 47 ms
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 53 ms
[2024-05-30 02:50:46] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 5 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 46 ms
[2024-05-30 02:50:46] [INFO ] Flatten gal took : 50 ms
[2024-05-30 02:50:46] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 44 ms
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 48 ms
[2024-05-30 02:50:47] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.5 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 36 ms
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 40 ms
[2024-05-30 02:50:47] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 45 ms
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 49 ms
[2024-05-30 02:50:47] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 46 ms
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 52 ms
[2024-05-30 02:50:47] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 10 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 46 ms
[2024-05-30 02:50:47] [INFO ] Flatten gal took : 51 ms
[2024-05-30 02:50:47] [INFO ] Input system was already deterministic with 1331 transitions.
[2024-05-30 02:50:48] [INFO ] Flatten gal took : 70 ms
[2024-05-30 02:50:48] [INFO ] Flatten gal took : 62 ms
[2024-05-30 02:50:48] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 11 ms.
[2024-05-30 02:50:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 10 ms.
Total runtime 29202 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN11

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: 1694
TRANSITIONS: 1331
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.036s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 569
MODEL NAME: /home/mcc/execution/411/model
1694 places, 1331 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 1717039942915

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-COL-AN11"
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-AN11, 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-171690530500489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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