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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 12 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:48 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-d1m07-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716320156200

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-d1m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 19:35:57] [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:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:35:57] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-21 19:35:57] [INFO ] Transformed 1440 places.
[2024-05-21 19:35:57] [INFO ] Transformed 672 transitions.
[2024-05-21 19:35:57] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 327 transition count 594
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 188 place count 237 transition count 345
Iterating global reduction 1 with 90 rules applied. Total rules applied 278 place count 237 transition count 345
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 286 place count 237 transition count 337
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 355 place count 168 transition count 268
Iterating global reduction 2 with 69 rules applied. Total rules applied 424 place count 168 transition count 268
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 429 place count 168 transition count 263
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 465 place count 132 transition count 204
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 132 transition count 204
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 519 place count 132 transition count 186
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 529 place count 122 transition count 169
Iterating global reduction 4 with 10 rules applied. Total rules applied 539 place count 122 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 541 place count 122 transition count 167
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 546 place count 117 transition count 162
Iterating global reduction 5 with 5 rules applied. Total rules applied 551 place count 117 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 553 place count 117 transition count 160
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 556 place count 114 transition count 157
Iterating global reduction 6 with 3 rules applied. Total rules applied 559 place count 114 transition count 157
Applied a total of 559 rules in 114 ms. Remains 114 /347 variables (removed 233) and now considering 157/672 (removed 515) transitions.
// Phase 1: matrix 157 rows 114 cols
[2024-05-21 19:35:57] [INFO ] Computed 2 invariants in 15 ms
[2024-05-21 19:35:58] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 19:35:58] [INFO ] Invariant cache hit.
[2024-05-21 19:35:58] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 19:35:58] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-21 19:35:58] [INFO ] Invariant cache hit.
[2024-05-21 19:35:58] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/270 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 59/174 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 175 constraints, problems are : Problem set: 0 solved, 156 unsolved in 7208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/270 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 59/174 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 148/322 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 8/331 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 331 constraints, problems are : Problem set: 0 solved, 156 unsolved in 11933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
After SMT, in 19445ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 19459ms
Starting structural reductions in LTL mode, iteration 1 : 114/347 places, 157/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20164 ms. Remains : 114/347 places, 157/672 transitions.
Support contains 16 out of 114 places after structural reductions.
[2024-05-21 19:36:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 19:36:18] [INFO ] Flatten gal took : 39 ms
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:36:18] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:36:18] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 6 out of 114 places (down from 16) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9169 resets) in 1479 ms. (27 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (3950 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3993 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3865 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
[2024-05-21 19:36:18] [INFO ] Invariant cache hit.
[2024-05-21 19:36:18] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 43/46 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/74 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 19:36:18] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 110/184 variables, 74/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 12/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 80/264 variables, 36/125 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 44/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/271 variables, 4/173 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 3/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/271 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 176 constraints, problems are : Problem set: 2 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/68 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/74 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 110/184 variables, 74/77 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 12/89 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/264 variables, 36/126 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 44/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/271 variables, 4/174 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 3/177 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/271 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 177 constraints, problems are : Problem set: 2 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 357ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 157/157 transitions.
Graph (complete) has 359 edges and 114 vertex of which 112 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 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 112 transition count 153
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 101 transition count 140
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 101 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 101 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 39 place count 92 transition count 126
Iterating global reduction 2 with 9 rules applied. Total rules applied 48 place count 92 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 88 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 88 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 87 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 86 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 86 transition count 110
Applied a total of 68 rules in 51 ms. Remains 86 /114 variables (removed 28) and now considering 110/157 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 86/114 places, 110/157 transitions.
RANDOM walk for 40000 steps (9112 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3946 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14675 steps, run visited all 1 properties in 45 ms. (steps per millisecond=326 )
Probabilistic random walk after 14675 steps, saw 6969 distinct states, run finished after 48 ms. (steps per millisecond=305 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:36:19] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:36:19] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:36:19] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 2 out of 114 places (down from 4) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 391 edges and 114 vertex of which 112 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 156
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 102 transition count 143
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 102 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 102 transition count 140
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 36 place count 93 transition count 129
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 93 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 89 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 89 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 88 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 87 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 87 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 87 transition count 112
Applied a total of 65 rules in 10 ms. Remains 87 /114 variables (removed 27) and now considering 112/157 (removed 45) transitions.
// Phase 1: matrix 112 rows 87 cols
[2024-05-21 19:36:19] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 19:36:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 19:36:19] [INFO ] Invariant cache hit.
[2024-05-21 19:36:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 19:36:19] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-21 19:36:19] [INFO ] Invariant cache hit.
[2024-05-21 19:36:19] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 6215ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6217ms
Starting structural reductions in LTL mode, iteration 1 : 87/114 places, 112/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6449 ms. Remains : 87/114 places, 112/157 transitions.
[2024-05-21 19:36:25] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:36:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:36:25] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 19:36:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:36:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:36:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2559202563414570379.gal : 4 ms
[2024-05-21 19:36:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality8719536607226961548.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/CTLCardinality2559202563414570379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8719536607226961548.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,2.55499e+06,6.06701,176420,2,20261,5,553245,6,0,460,597184,0


Converting to forward existential form...Done !
original formula: AF(EX((l539>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((l539>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t42, t49, t55, t56, t57, t73, t80, t81, t82, t83, t84, t85, t86, t...390
(forward)formula 0,0,22.8036,580684,1,0,456,2.17301e+06,246,267,3194,2.83652e+06,425
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 156
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 101 transition count 142
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 101 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 101 transition count 139
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 39 place count 91 transition count 127
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 91 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 91 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 57 place count 86 transition count 115
Iterating global reduction 3 with 5 rules applied. Total rules applied 62 place count 86 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 66 place count 86 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 68 place count 84 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 83 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 83 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 83 transition count 101
Applied a total of 74 rules in 26 ms. Remains 83 /114 variables (removed 31) and now considering 101/157 (removed 56) transitions.
// Phase 1: matrix 101 rows 83 cols
[2024-05-21 19:36:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:36:48] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:36:48] [INFO ] Invariant cache hit.
[2024-05-21 19:36:49] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 19:36:49] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 19:36:49] [INFO ] Invariant cache hit.
[2024-05-21 19:36:49] [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 1694 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 3151 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 4927ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4930ms
Starting structural reductions in LTL mode, iteration 1 : 83/114 places, 101/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5210 ms. Remains : 83/114 places, 101/157 transitions.
[2024-05-21 19:36:54] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:36:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:36:54] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 19:36:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:36:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:36:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6049081143262555612.gal : 2 ms
[2024-05-21 19:36:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2046469832457528074.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/CTLCardinality6049081143262555612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2046469832457528074.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,2.19241e+06,3.50085,107904,2,15449,5,345875,6,0,433,398280,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t63, t70, t71, t72, t73, t74, t75, t76, t77, t78, t...364
(forward)formula 0,0,17.893,453692,1,0,465,1.79891e+06,223,259,3031,2.4309e+06,400
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 157/157 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 156
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 102 transition count 143
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 102 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 102 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 35 place count 93 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 93 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 93 transition count 128
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 88 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 88 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 61 place count 88 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 86 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 85 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 85 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 85 transition count 105
Applied a total of 69 rules in 10 ms. Remains 85 /114 variables (removed 29) and now considering 105/157 (removed 52) transitions.
// Phase 1: matrix 105 rows 85 cols
[2024-05-21 19:37:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:37:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:37:12] [INFO ] Invariant cache hit.
[2024-05-21 19:37:12] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:37:12] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-21 19:37:12] [INFO ] Invariant cache hit.
[2024-05-21 19:37:12] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/190 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 121 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/190 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 104/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 225 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 5739ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 5740ms
Starting structural reductions in LTL mode, iteration 1 : 85/114 places, 105/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6095 ms. Remains : 85/114 places, 105/157 transitions.
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:37:18] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:37:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality16686762486075800993.gal : 1 ms
[2024-05-21 19:37:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality10314974597554860446.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/CTLCardinality16686762486075800993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10314974597554860446.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 -...285
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,2.24834e+06,4.28577,132460,2,17998,5,411645,6,0,445,472947,0


Converting to forward existential form...Done !
original formula: EX(!(A(EF((l294>0)) U AG(EX(TRUE)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),!(!(E(TRUE U !(EX(TRUE)))))) * !(E(TRUE U (l294>0)))),TRUE) * !(EX(TRUE)))] != FALSE + [F...207
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t41, t47, t49, t50, t51, t67, t74, t75, t76, t77, t78, t79, t80, t81, t...373
(forward)formula 0,1,18.2626,466544,1,0,238,2.02782e+06,232,103,3212,1.58048e+06,276
FORMULA DBSingleClientW-PT-d1m07-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 19:37:36] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:37:36] [INFO ] Flatten gal took : 7 ms
Total runtime 99439 ms.

BK_STOP 1716320256825

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-d1m07"
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-d1m07, 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-171624189400513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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