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.r536-tall-171690532800657.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 ltsminxred
Input is Sudoku-PT-AN12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532800657
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 53M
-rw-r--r-- 1 mcc users 604K Apr 12 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 11:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.4M Apr 12 11:05 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 308K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 810K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 393K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9M Apr 12 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29M Apr 12 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Apr 23 08:00 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 963K 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-AN12-CTLCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN12-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717273123377

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:18:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:18:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:18:44] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-06-01 20:18:44] [INFO ] Transformed 2160 places.
[2024-06-01 20:18:44] [INFO ] Transformed 1728 transitions.
[2024-06-01 20:18:44] [INFO ] Found NUPN structural information;
[2024-06-01 20:18:44] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 100 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN12-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 29 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 20:18:45] [INFO ] Computed 432 invariants in 55 ms
[2024-06-01 20:18:45] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-06-01 20:18:45] [INFO ] Invariant cache hit.
[2024-06-01 20:18:47] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in LTL mode , in 1 iterations and 2269 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2024-06-01 20:18:47] [INFO ] Flatten gal took : 187 ms
[2024-06-01 20:18:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-PT-AN12-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:18:47] [INFO ] Flatten gal took : 123 ms
[2024-06-01 20:18:48] [INFO ] Input system was already deterministic with 1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 10692 ms. (3 steps per ms) remains 9/56 properties
BEST_FIRST walk for 40004 steps (8 resets) in 480 ms. (83 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2349 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 633 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 580 ms. (68 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 7/8 properties
[2024-06-01 20:18:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2160 variables, 2160/2160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5036 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2160 variables, 2160/2160 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2160/3888 variables, and 2592 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5009 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10556ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 34 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2160/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 7605 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2131 ms. (18 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 83182 steps, run timeout after 6005 ms. (steps per millisecond=13 ) properties seen :0 out of 5
Probabilistic random walk after 83182 steps, saw 83089 distinct states, run finished after 6009 ms. (steps per millisecond=13 ) properties seen :0
[2024-06-01 20:19:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2160 variables, 2160/2160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45025 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2160 variables, 2160/2160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 1 solved, 4 unsolved in 45023 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 90395ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 432 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.6 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 37 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 432/2160 places, 1728/1728 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-06-01 20:20:43] [INFO ] Flatten gal took : 105 ms
[2024-06-01 20:20:43] [INFO ] Flatten gal took : 78 ms
[2024-06-01 20:20:43] [INFO ] Input system was already deterministic with 1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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-PT-AN12-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.7 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 76 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 432/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:43] [INFO ] Flatten gal took : 51 ms
[2024-06-01 20:20:43] [INFO ] Flatten gal took : 57 ms
[2024-06-01 20:20:44] [INFO ] Input system was already deterministic with 1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 4446 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 231064 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 231064 steps, saw 167735 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:20:48] [INFO ] Computed 35 invariants in 109 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/429 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 285/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/432 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1288 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 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/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/429 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 285/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/432 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 672 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2137ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 139 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=17 )
FORMULA Sudoku-PT-AN12-CTLCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 23 ms.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 32 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 432/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:50] [INFO ] Flatten gal took : 50 ms
[2024-06-01 20:20:50] [INFO ] Flatten gal took : 53 ms
[2024-06-01 20:20:50] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 23 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 432/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:50] [INFO ] Flatten gal took : 64 ms
[2024-06-01 20:20:50] [INFO ] Flatten gal took : 48 ms
[2024-06-01 20:20:51] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 55 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:51] [INFO ] Flatten gal took : 76 ms
[2024-06-01 20:20:51] [INFO ] Flatten gal took : 68 ms
[2024-06-01 20:20:51] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 16 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 432/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:51] [INFO ] Flatten gal took : 42 ms
[2024-06-01 20:20:51] [INFO ] Flatten gal took : 46 ms
[2024-06-01 20:20:51] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 14 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 432/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:51] [INFO ] Flatten gal took : 43 ms
[2024-06-01 20:20:51] [INFO ] Flatten gal took : 60 ms
[2024-06-01 20:20:51] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 429 are kept as prefixes of interest. Removing 1731 places using SCC suffix rule.5 ms
Discarding 1731 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 166 ms. Remains 429 /2160 variables (removed 1731) and now considering 1726/1728 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 166 ms. Remains : 429/2160 places, 1726/1728 transitions.
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 40 ms
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 43 ms
[2024-06-01 20:20:52] [INFO ] Input system was already deterministic with 1726 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1709 places and 0 transitions.
Iterating post reduction 0 with 1709 rules applied. Total rules applied 1709 place count 451 transition count 1728
Applied a total of 1709 rules in 33 ms. Remains 451 /2160 variables (removed 1709) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 451/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 46 ms
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 45 ms
[2024-06-01 20:20:52] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 435 are kept as prefixes of interest. Removing 1725 places using SCC suffix rule.4 ms
Discarding 1725 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 46 ms. Remains 435 /2160 variables (removed 1725) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 435/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 42 ms
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 46 ms
[2024-06-01 20:20:52] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 434 are kept as prefixes of interest. Removing 1726 places using SCC suffix rule.2 ms
Discarding 1726 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 42 ms. Remains 434 /2160 variables (removed 1726) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 434/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 43 ms
[2024-06-01 20:20:52] [INFO ] Flatten gal took : 48 ms
[2024-06-01 20:20:53] [INFO ] Input system was already deterministic with 1728 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 436 are kept as prefixes of interest. Removing 1724 places using SCC suffix rule.2 ms
Discarding 1724 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 42 ms. Remains 436 /2160 variables (removed 1724) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 436/2160 places, 1728/1728 transitions.
[2024-06-01 20:20:53] [INFO ] Flatten gal took : 41 ms
[2024-06-01 20:20:53] [INFO ] Flatten gal took : 44 ms
[2024-06-01 20:20:53] [INFO ] Input system was already deterministic with 1728 transitions.
[2024-06-01 20:20:53] [INFO ] Flatten gal took : 61 ms
[2024-06-01 20:20:53] [INFO ] Flatten gal took : 61 ms
[2024-06-01 20:20:53] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-01 20:20:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2160 places, 1728 transitions and 6912 arcs took 11 ms.
Total runtime 128993 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-02
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-03
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-04
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-06
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-07
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-09
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-10
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-12
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-13
Could not compute solution for formula : Sudoku-PT-AN12-CTLCardinality-2024-15

BK_STOP 1717273253862

--------------------
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
mcc2024
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/536/ctl_0_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/536/ctl_1_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/536/ctl_2_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/536/ctl_3_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/536/ctl_4_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/536/ctl_5_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/536/ctl_6_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/536/ctl_7_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/536/ctl_8_
ctl formula name Sudoku-PT-AN12-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/536/ctl_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-AN12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-PT-AN12, 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 r536-tall-171690532800657"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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