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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-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 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:52 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 432K 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-d1m05-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716319670111

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-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 19:27:51] [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:27:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:27:51] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-21 19:27:51] [INFO ] Transformed 1440 places.
[2024-05-21 19:27:51] [INFO ] Transformed 672 transitions.
[2024-05-21 19:27:51] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 327 transition count 611
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 167 place count 241 transition count 372
Iterating global reduction 1 with 86 rules applied. Total rules applied 253 place count 241 transition count 372
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 262 place count 241 transition count 363
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 322 place count 181 transition count 303
Iterating global reduction 2 with 60 rules applied. Total rules applied 382 place count 181 transition count 303
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 385 place count 181 transition count 300
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 415 place count 151 transition count 254
Iterating global reduction 3 with 30 rules applied. Total rules applied 445 place count 151 transition count 254
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 462 place count 151 transition count 237
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 466 place count 147 transition count 230
Iterating global reduction 4 with 4 rules applied. Total rules applied 470 place count 147 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 473 place count 147 transition count 227
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 475 place count 145 transition count 225
Iterating global reduction 5 with 2 rules applied. Total rules applied 477 place count 145 transition count 225
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 479 place count 143 transition count 223
Iterating global reduction 5 with 2 rules applied. Total rules applied 481 place count 143 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 143 transition count 222
Applied a total of 482 rules in 85 ms. Remains 143 /347 variables (removed 204) and now considering 222/672 (removed 450) transitions.
// Phase 1: matrix 222 rows 143 cols
[2024-05-21 19:27:51] [INFO ] Computed 2 invariants in 18 ms
[2024-05-21 19:27:51] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-21 19:27:51] [INFO ] Invariant cache hit.
[2024-05-21 19:27:52] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-21 19:27:52] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 19:27:52] [INFO ] Invariant cache hit.
[2024-05-21 19:27:52] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/364 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 238 constraints, problems are : Problem set: 0 solved, 221 unsolved in 11201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/364 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 197/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 24/459 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 459 constraints, problems are : Problem set: 0 solved, 221 unsolved in 26692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 38391ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 38406ms
Starting structural reductions in LTL mode, iteration 1 : 143/347 places, 222/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39194 ms. Remains : 143/347 places, 222/672 transitions.
Support contains 23 out of 143 places after structural reductions.
[2024-05-21 19:28:30] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-21 19:28:30] [INFO ] Flatten gal took : 49 ms
[2024-05-21 19:28:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:28:30] [INFO ] Flatten gal took : 19 ms
[2024-05-21 19:28:31] [INFO ] Input system was already deterministic with 222 transitions.
Support contains 8 out of 143 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (9163 resets) in 1884 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3932 resets) in 443 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3936 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3981 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3818 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3803 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3993 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3968 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4000 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 448758 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :2 out of 8
Probabilistic random walk after 448758 steps, saw 175604 distinct states, run finished after 3006 ms. (steps per millisecond=149 ) properties seen :2
[2024-05-21 19:28:35] [INFO ] Invariant cache hit.
[2024-05-21 19:28:35] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/59 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/98 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 154/252 variables, 98/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 25/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 8 (OVERLAPS) 103/355 variables, 40/165 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 63/228 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 11 (OVERLAPS) 10/365 variables, 5/233 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 5/238 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/238 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/365 variables, 0/238 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 238 constraints, problems are : Problem set: 5 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/142 variables, 4/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 52/194 variables, 1/15 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 52/67 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/233 variables, 1/68 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 11/79 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 122/355 variables, 70/149 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 80/229 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/229 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/365 variables, 5/234 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 5/239 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 0/239 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/365 variables, 0/239 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 239 constraints, problems are : Problem set: 5 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 222/222 transitions.
Graph (complete) has 463 edges and 143 vertex of which 141 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 141 transition count 214
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 26 place count 124 transition count 179
Iterating global reduction 1 with 17 rules applied. Total rules applied 43 place count 124 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 124 transition count 175
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 61 place count 110 transition count 159
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 110 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 110 transition count 152
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 89 place count 103 transition count 138
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 103 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 103 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 103 place count 97 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 109 place count 97 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 97 transition count 127
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 115 place count 92 transition count 122
Iterating global reduction 5 with 5 rules applied. Total rules applied 120 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 122 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 125 place count 89 transition count 117
Iterating global reduction 6 with 3 rules applied. Total rules applied 128 place count 89 transition count 117
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 130 place count 87 transition count 109
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 87 transition count 109
Applied a total of 132 rules in 35 ms. Remains 87 /143 variables (removed 56) and now considering 109/222 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 87/143 places, 109/222 transitions.
RANDOM walk for 40000 steps (9155 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3882 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Probably explored full state space saw : 93725 states, properties seen :0
Probabilistic random walk after 235011 steps, saw 93725 distinct states, run finished after 243 ms. (steps per millisecond=967 ) properties seen :0
Explored full state space saw : 94420 states, properties seen :0
Exhaustive walk after 236721 steps, saw 94420 distinct states, run finished after 186 ms. (steps per millisecond=1272 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:28:36] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:28:36] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:28:36] [INFO ] Input system was already deterministic with 222 transitions.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 508 edges and 143 vertex of which 141 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 222/222 transitions.
Graph (complete) has 508 edges and 143 vertex of which 142 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 142 transition count 218
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 125 transition count 182
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 125 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 125 transition count 178
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 57 place count 111 transition count 162
Iterating global reduction 2 with 14 rules applied. Total rules applied 71 place count 111 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 111 transition count 156
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 85 place count 103 transition count 138
Iterating global reduction 3 with 8 rules applied. Total rules applied 93 place count 103 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 101 place count 96 transition count 126
Iterating global reduction 4 with 7 rules applied. Total rules applied 108 place count 96 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 96 transition count 125
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 115 place count 90 transition count 119
Iterating global reduction 5 with 6 rules applied. Total rules applied 121 place count 90 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 125 place count 90 transition count 115
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 128 place count 87 transition count 112
Iterating global reduction 6 with 3 rules applied. Total rules applied 131 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 86 transition count 110
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 86 transition count 110
Applied a total of 133 rules in 28 ms. Remains 86 /143 variables (removed 57) and now considering 110/222 (removed 112) transitions.
// Phase 1: matrix 110 rows 86 cols
[2024-05-21 19:28:36] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:28:36] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 19:28:36] [INFO ] Invariant cache hit.
[2024-05-21 19:28:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 19:28:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 19:28:36] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:28:36] [INFO ] Invariant cache hit.
[2024-05-21 19:28:36] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:28:38] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 7 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/196 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 127 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3604 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/196 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 38/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 109/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 236 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints]
After SMT, in 7167ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7169ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/143 places, 110/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7404 ms. Remains : 86/143 places, 110/222 transitions.
[2024-05-21 19:28:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:28:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:28:43] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-21 19:28:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:28:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10996784688870889193.gal : 3 ms
[2024-05-21 19:28:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality2321557244120570508.ctl : 2 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/CTLCardinality10996784688870889193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2321557244120570508.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,64527,0.404699,20284,2,5353,5,54502,6,0,454,49070,0


Converting to forward existential form...Done !
original formula: EG((p24<=0))
=> equivalent forward existential formula: [FwdG(Init,(p24<=0))] != FALSE
Hit Full ! (commute/partial/dont) 108/0/2
(forward)formula 0,1,1.52523,51296,1,0,19,188505,19,4,2426,115575,16
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 222/222 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 142 transition count 218
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 124 transition count 181
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 124 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 124 transition count 177
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 60 place count 109 transition count 160
Iterating global reduction 2 with 15 rules applied. Total rules applied 75 place count 109 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 109 transition count 153
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 90 place count 101 transition count 135
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 101 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 101 transition count 134
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 106 place count 94 transition count 123
Iterating global reduction 4 with 7 rules applied. Total rules applied 113 place count 94 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 94 transition count 122
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 120 place count 88 transition count 116
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 88 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 130 place count 88 transition count 112
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 133 place count 85 transition count 109
Iterating global reduction 6 with 3 rules applied. Total rules applied 136 place count 85 transition count 109
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 138 place count 83 transition count 101
Iterating global reduction 6 with 2 rules applied. Total rules applied 140 place count 83 transition count 101
Applied a total of 140 rules in 11 ms. Remains 83 /143 variables (removed 60) and now considering 101/222 (removed 121) transitions.
// Phase 1: matrix 101 rows 83 cols
[2024-05-21 19:28:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:28:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:28:45] [INFO ] Invariant cache hit.
[2024-05-21 19:28:45] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 19:28:45] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 19:28:45] [INFO ] Invariant cache hit.
[2024-05-21 19:28:45] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 5220ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5224ms
Starting structural reductions in LTL mode, iteration 1 : 83/143 places, 101/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5410 ms. Remains : 83/143 places, 101/222 transitions.
[2024-05-21 19:28:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:28:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:28:50] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 19:28:50] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:50] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality12528456371867865470.gal : 3 ms
[2024-05-21 19:28:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2309484088185627285.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/CTLCardinality12528456371867865470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2309484088185627285.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,59273,0.43244,21348,2,5340,5,61757,6,0,433,58395,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.434797,21348,1,0,6,61757,7,1,580,58395,1
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 222/222 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 142 transition count 218
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 125 transition count 182
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 125 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 125 transition count 179
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 57 place count 110 transition count 162
Iterating global reduction 2 with 15 rules applied. Total rules applied 72 place count 110 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 79 place count 110 transition count 155
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 86 place count 103 transition count 139
Iterating global reduction 3 with 7 rules applied. Total rules applied 93 place count 103 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 103 transition count 138
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 100 place count 97 transition count 129
Iterating global reduction 4 with 6 rules applied. Total rules applied 106 place count 97 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 112 place count 91 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 118 place count 91 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 91 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 125 place count 88 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 128 place count 88 transition count 116
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 86 transition count 108
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 86 transition count 108
Applied a total of 132 rules in 15 ms. Remains 86 /143 variables (removed 57) and now considering 108/222 (removed 114) transitions.
// Phase 1: matrix 108 rows 86 cols
[2024-05-21 19:28:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:28:51] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 19:28:51] [INFO ] Invariant cache hit.
[2024-05-21 19:28:51] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:28:51] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-21 19:28:51] [INFO ] Invariant cache hit.
[2024-05-21 19:28:51] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 5539ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5541ms
Starting structural reductions in LTL mode, iteration 1 : 86/143 places, 108/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5749 ms. Remains : 86/143 places, 108/222 transitions.
[2024-05-21 19:28:56] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:28:56] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:56] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-21 19:28:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:28:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:28:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality2973122206784052389.gal : 2 ms
[2024-05-21 19:28:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality2266688943401027337.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/CTLCardinality2973122206784052389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2266688943401027337.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,62041,0.388847,20084,2,4281,5,58529,6,0,452,38981,0


Converting to forward existential form...Done !
original formula: (EX(EF((p112>=1))) * EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * EX(E(TRUE U (p112>=1))))) * TRUE)] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t67, t75, t76, t77, t78, t79, t80, t81, t82, t83, t...381
(forward)formula 0,1,1.74602,57752,1,0,239,252293,237,103,3183,144746,278
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 19:28:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:28:58] [INFO ] Flatten gal took : 9 ms
Total runtime 67628 ms.

BK_STOP 1716319738878

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

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