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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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-d0m09-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716318353219

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-d0m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 19:05:54] [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 19:05:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:05:54] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 19:05:54] [INFO ] Transformed 553 places.
[2024-05-21 19:05:54] [INFO ] Transformed 150 transitions.
[2024-05-21 19:05:54] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 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 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 103 transition count 139
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 83 transition count 104
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 83 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 83 transition count 103
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 76 transition count 96
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 76 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 76 transition count 95
Applied a total of 73 rules in 33 ms. Remains 76 /109 variables (removed 33) and now considering 95/150 (removed 55) transitions.
// Phase 1: matrix 95 rows 76 cols
[2024-05-21 19:05:54] [INFO ] Computed 3 invariants in 12 ms
[2024-05-21 19:05:54] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 19:05:54] [INFO ] Invariant cache hit.
[2024-05-21 19:05:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 19:05:54] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-21 19:05:54] [INFO ] Invariant cache hit.
[2024-05-21 19:05:55] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/171 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 111 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/171 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 94/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 205 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 5240ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5269ms
Starting structural reductions in LTL mode, iteration 1 : 76/109 places, 95/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5674 ms. Remains : 76/109 places, 95/150 transitions.
Support contains 12 out of 76 places after structural reductions.
[2024-05-21 19:06:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 19:06:00] [INFO ] Flatten gal took : 29 ms
[2024-05-21 19:06:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:06:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:06:00] [INFO ] Input system was already deterministic with 95 transitions.
Support contains 7 out of 76 places (down from 12) after GAL structural reductions.
RANDOM walk for 40000 steps (9198 resets) in 1505 ms. (26 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (3968 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4214 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (4026 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4180 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3973 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
[2024-05-21 19:06:01] [INFO ] Invariant cache hit.
[2024-05-21 19:06:01] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/32 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/60 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 79/139 variables, 60/63 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 16/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 8 (OVERLAPS) 32/171 variables, 16/95 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 16/111 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/171 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 111 constraints, problems are : Problem set: 3 solved, 2 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 19:06:01] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 14 ms to minimize.
[2024-05-21 19:06:01] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:06:01] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:06:01] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 77/136 variables, 59/66 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 14/80 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 35/171 variables, 17/98 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 18/116 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/171 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 117 constraints, problems are : Problem set: 3 solved, 2 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 407ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 1 properties in 44 ms.
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 95/95 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 71 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 66 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 66 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 66 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 64 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 64 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 62 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 62 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 60 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 60 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 36 place count 60 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 59 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 59 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 40 place count 59 transition count 64
Applied a total of 40 rules in 22 ms. Remains 59 /76 variables (removed 17) and now considering 64/95 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 59/76 places, 64/95 transitions.
RANDOM walk for 40000 steps (9149 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4142 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4887 steps, run visited all 1 properties in 20 ms. (steps per millisecond=244 )
Probabilistic random walk after 4887 steps, saw 2206 distinct states, run finished after 23 ms. (steps per millisecond=212 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 2 simplifications.
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:06:01] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:06:01] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:06:01] [INFO ] Input system was already deterministic with 95 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 249 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 95/95 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 70 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 65 transition count 79
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 63 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 41 place count 58 transition count 64
Applied a total of 41 rules in 13 ms. Remains 58 /76 variables (removed 18) and now considering 64/95 (removed 31) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 19:06:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:06:01] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:06:01] [INFO ] Invariant cache hit.
[2024-05-21 19:06:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:06:01] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 19:06:01] [INFO ] Invariant cache hit.
[2024-05-21 19:06:01] [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
All remaining problems are real, not stopping.
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 766 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 1331 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 2144ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2146ms
Starting structural reductions in LTL mode, iteration 1 : 58/76 places, 64/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2304 ms. Remains : 58/76 places, 64/95 transitions.
[2024-05-21 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:04] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 19:06:04] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality17009275564569428790.gal : 2 ms
[2024-05-21 19:06:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality5587405720652673804.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/CTLCardinality17009275564569428790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5587405720652673804.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,7.69781e+06,1.86499,58120,2,14374,5,201914,6,0,296,247337,0


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

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

Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 95/95 transitions.
Graph (complete) has 249 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 70 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 65 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 63 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 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 37 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 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 41 place count 58 transition count 64
Applied a total of 41 rules in 20 ms. Remains 58 /76 variables (removed 18) and now considering 64/95 (removed 31) transitions.
[2024-05-21 19:06:06] [INFO ] Invariant cache hit.
[2024-05-21 19:06:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:06:06] [INFO ] Invariant cache hit.
[2024-05-21 19:06:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:06:06] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-21 19:06:06] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-21 19:06:06] [INFO ] Invariant cache hit.
[2024-05-21 19:06:06] [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
All remaining problems are real, not stopping.
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 757 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 1346 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 2147ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2148ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/76 places, 64/95 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2319 ms. Remains : 58/76 places, 64/95 transitions.
[2024-05-21 19:06:08] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:06:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:08] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 19:06:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13408961623577202810.gal : 2 ms
[2024-05-21 19:06:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality764842440322596657.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/CTLCardinality13408961623577202810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality764842440322596657.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,7.69781e+06,1.82837,58328,2,14374,5,201914,6,0,296,247337,0


Converting to forward existential form...Done !
original formula: EG(EF((l125<=0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (l125<=0)))] != 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
(forward)formula 0,1,18.4267,496832,1,0,436,1.96944e+06,155,264,2053,3.05712e+06,361
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2023-13 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 : 76/76 places, 95/95 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 70 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 65 transition count 79
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 63 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 41 place count 58 transition count 64
Applied a total of 41 rules in 11 ms. Remains 58 /76 variables (removed 18) and now considering 64/95 (removed 31) transitions.
[2024-05-21 19:06:27] [INFO ] Invariant cache hit.
[2024-05-21 19:06:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:06:27] [INFO ] Invariant cache hit.
[2024-05-21 19:06:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:06:27] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 19:06:27] [INFO ] Invariant cache hit.
[2024-05-21 19:06:27] [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
All remaining problems are real, not stopping.
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 747 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 1353 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 2133ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2134ms
Starting structural reductions in LTL mode, iteration 1 : 58/76 places, 64/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2297 ms. Remains : 58/76 places, 64/95 transitions.
[2024-05-21 19:06:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:29] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 19:06:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:06:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:06:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7967712980948173867.gal : 1 ms
[2024-05-21 19:06:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1370241752964562237.ctl : 5 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/CTLCardinality7967712980948173867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1370241752964562237.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,7.69781e+06,1.77355,58344,2,14374,5,201914,6,0,296,247337,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.77512,58344,1,0,6,201914,7,1,403,247337,1
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 19:06:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:06:31] [INFO ] Flatten gal took : 6 ms
Total runtime 36851 ms.

BK_STOP 1716318391198

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

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