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.r092-tall-171624189300449.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 itstools
Input is DBSingleClientW-PT-d0m06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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 DBSingleClientW-PT-d0m06-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716317496205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 18:51:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 18:51:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:51:37] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-21 18:51:37] [INFO ] Transformed 553 places.
[2024-05-21 18:51:37] [INFO ] Transformed 150 transitions.
[2024-05-21 18:51:37] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 103 transition count 146
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 31 place count 82 transition count 107
Iterating global reduction 1 with 21 rules applied. Total rules applied 52 place count 82 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 73 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 71 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 70 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 69 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 69 transition count 88
Applied a total of 81 rules in 39 ms. Remains 69 /109 variables (removed 40) and now considering 88/150 (removed 62) transitions.
// Phase 1: matrix 88 rows 69 cols
[2024-05-21 18:51:37] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 18:51:37] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 18:51:37] [INFO ] Invariant cache hit.
[2024-05-21 18:51:37] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:51:37] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-21 18:51:37] [INFO ] Invariant cache hit.
[2024-05-21 18:51:37] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/156 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:51:39] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 9 ms to minimize.
[2024-05-21 18:51:39] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:51:40] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/157 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/157 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 108 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/156 variables, 68/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 75/182 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/157 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/157 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 195 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
After SMT, in 7303ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 7314ms
Starting structural reductions in LTL mode, iteration 1 : 69/109 places, 88/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7730 ms. Remains : 69/109 places, 88/150 transitions.
Support contains 9 out of 69 places after structural reductions.
[2024-05-21 18:51:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 18:51:45] [INFO ] Flatten gal took : 26 ms
[2024-05-21 18:51:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:51:45] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:51:45] [INFO ] Input system was already deterministic with 88 transitions.
Support contains 5 out of 69 places (down from 9) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9181 resets) in 895 ms. (44 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (4009 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4004 resets) in 161 ms. (246 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (4084 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
[2024-05-21 18:51:46] [INFO ] Invariant cache hit.
[2024-05-21 18:51:46] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 10/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 8 (OVERLAPS) 39/151 variables, 18/78 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 21/99 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/157 variables, 3/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 3/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/157 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 105 constraints, problems are : Problem set: 2 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/71 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 6/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 21/92 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 21/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/112 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 8/49 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/153 variables, 27/76 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/153 variables, 26/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/157 variables, 2/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/157 variables, 2/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/157 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 106 constraints, problems are : Problem set: 2 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 88/88 transitions.
Graph (complete) has 205 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 65 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 63 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 62 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 61 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 59 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 59 transition count 67
Applied a total of 26 rules in 26 ms. Remains 59 /69 variables (removed 10) and now considering 67/88 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 59/69 places, 67/88 transitions.
RANDOM walk for 40000 steps (9227 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4071 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3966 steps, run visited all 1 properties in 16 ms. (steps per millisecond=247 )
Probabilistic random walk after 3966 steps, saw 1787 distinct states, run finished after 19 ms. (steps per millisecond=208 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:51:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:51:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:51:46] [INFO ] Input system was already deterministic with 88 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 227 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 64 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 62 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 61 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 60 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 58 transition count 64
Applied a total of 29 rules in 15 ms. Remains 58 /69 variables (removed 11) and now considering 64/88 (removed 24) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 18:51:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:51:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 18:51:46] [INFO ] Invariant cache hit.
[2024-05-21 18:51:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:51:46] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 18:51:46] [INFO ] Invariant cache hit.
[2024-05-21 18:51:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2294ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2295ms
Starting structural reductions in LTL mode, iteration 1 : 58/69 places, 64/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2435 ms. Remains : 58/69 places, 64/88 transitions.
[2024-05-21 18:51:48] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:51:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:51:48] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 18:51:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:51:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:51:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5486605913269225237.gal : 2 ms
[2024-05-21 18:51:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8634500962919792679.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5486605913269225237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8634500962919792679.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,133604,0.279308,15216,2,4969,5,44105,6,0,296,44127,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.280548,15216,1,0,6,44105,7,1,403,44127,1
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 66 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 62 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 61 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 60 transition count 68
Applied a total of 24 rules in 12 ms. Remains 60 /69 variables (removed 9) and now considering 68/88 (removed 20) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 18:51:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:51:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:51:49] [INFO ] Invariant cache hit.
[2024-05-21 18:51:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 18:51:49] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-21 18:51:49] [INFO ] Invariant cache hit.
[2024-05-21 18:51:49] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 85 constraints, problems are : Problem set: 0 solved, 67 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/152 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 152 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 2508ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2508ms
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 68/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2638 ms. Remains : 60/69 places, 68/88 transitions.
[2024-05-21 18:51:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:51:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:51:51] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-21 18:51:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:51:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:51:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8180748613894611997.gal : 1 ms
[2024-05-21 18:51:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8969193456830548491.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8180748613894611997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8969193456830548491.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,139978,0.407166,20632,2,5790,5,65815,6,0,308,58784,0


Converting to forward existential form...Done !
original formula: EG((AF((l497<=0)) * AX((p12<1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((l497<=0)))) * !(EX(!((p12<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...296
(forward)formula 0,1,3.19159,104992,1,0,396,430487,165,218,2098,525809,400
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 64 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 62 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 61 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 60 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 58 transition count 64
Applied a total of 29 rules in 13 ms. Remains 58 /69 variables (removed 11) and now considering 64/88 (removed 24) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 18:51:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:51:55] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 18:51:55] [INFO ] Invariant cache hit.
[2024-05-21 18:51:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:51:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 18:51:55] [INFO ] Invariant cache hit.
[2024-05-21 18:51:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2356ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2357ms
Starting structural reductions in LTL mode, iteration 1 : 58/69 places, 64/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2487 ms. Remains : 58/69 places, 64/88 transitions.
[2024-05-21 18:51:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:51:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:51:57] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 18:51:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:51:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:51:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12265446751254852250.gal : 1 ms
[2024-05-21 18:51:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5100065784811890250.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12265446751254852250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5100065784811890250.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,133604,0.264827,15292,2,4969,5,44105,6,0,296,44127,0


Converting to forward existential form...Done !
original formula: (AF(EX(EG((l153>=2)))) + AF(((AX(FALSE) * EF(EX(TRUE))) + EX(TRUE))))
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!(EX(EG((l153>=2)))))))),!(((!(EX(!(FALSE))) * E(TRUE U EX(TRUE))) + EX(TRUE))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
Using saturation style SCC detection
(forward)formula 0,1,3.28277,115408,1,0,283,563556,165,145,2100,528037,330
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-21 18:52:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:52:00] [INFO ] Flatten gal took : 4 ms
Total runtime 23610 ms.

BK_STOP 1716317520945

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DBSingleClientW-PT-d0m06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d0m06, 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 r092-tall-171624189300449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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