About the Execution of ITS-Tools for DBSingleClientW-PT-d2m05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 245165.00 | 0.00 | 0.00 | TFFFTFTFFFFFTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DBSingleClientW-PT-d2m05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-15
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-00
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-01
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-02
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-03
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-04
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-05
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-06
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-07
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-08
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-09
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-10
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748605958000
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-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 11:52:40] [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]
[2025-05-30 11:52:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:52:41] [INFO ] Load time of PNML (sax parser for PT used): 615 ms
[2025-05-30 11:52:41] [INFO ] Transformed 4763 places.
[2025-05-30 11:52:41] [INFO ] Transformed 2478 transitions.
[2025-05-30 11:52:41] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 973 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Deduced a syphon composed of 3580 places in 26 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1139 transition count 2286
Discarding 383 places :
Symmetric choice reduction at 1 with 383 rule applications. Total rules 619 place count 756 transition count 1223
Iterating global reduction 1 with 383 rules applied. Total rules applied 1002 place count 756 transition count 1223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1010 place count 756 transition count 1215
Discarding 308 places :
Symmetric choice reduction at 2 with 308 rule applications. Total rules 1318 place count 448 transition count 907
Iterating global reduction 2 with 308 rules applied. Total rules applied 1626 place count 448 transition count 907
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1638 place count 448 transition count 895
Discarding 226 places :
Symmetric choice reduction at 3 with 226 rule applications. Total rules 1864 place count 222 transition count 581
Iterating global reduction 3 with 226 rules applied. Total rules applied 2090 place count 222 transition count 581
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 197 rules applied. Total rules applied 2287 place count 222 transition count 384
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2310 place count 199 transition count 340
Iterating global reduction 4 with 23 rules applied. Total rules applied 2333 place count 199 transition count 340
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2339 place count 199 transition count 334
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2353 place count 185 transition count 320
Iterating global reduction 5 with 14 rules applied. Total rules applied 2367 place count 185 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2368 place count 185 transition count 319
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2381 place count 172 transition count 306
Iterating global reduction 6 with 13 rules applied. Total rules applied 2394 place count 172 transition count 306
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2406 place count 172 transition count 294
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2408 place count 170 transition count 290
Iterating global reduction 7 with 2 rules applied. Total rules applied 2410 place count 170 transition count 290
Applied a total of 2410 rules in 365 ms. Remains 170 /1183 variables (removed 1013) and now considering 290/2478 (removed 2188) transitions.
// Phase 1: matrix 290 rows 170 cols
[2025-05-30 11:52:42] [INFO ] Computed 2 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:42] [INFO ] Implicit Places using invariants in 704 ms returned []
[2025-05-30 11:52:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:43] [INFO ] State equation strengthened by 123 read => feed constraints.
[2025-05-30 11:52:45] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3356 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-05-30 11:52:45] [INFO ] Invariant cache hit.
[2025-05-30 11:52:45] [INFO ] State equation strengthened by 123 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/458 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 123/293 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 289 unsolved
SMT process timed out in 31038ms, After SMT, problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 31063ms
Starting structural reductions in LTL mode, iteration 1 : 170/1183 places, 290/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34826 ms. Remains : 170/1183 places, 290/2478 transitions.
Support contains 23 out of 170 places after structural reductions.
[2025-05-30 11:53:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-05-30 11:53:16] [INFO ] Flatten gal took : 79 ms
[2025-05-30 11:53:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:53:16] [INFO ] Flatten gal took : 39 ms
[2025-05-30 11:53:17] [INFO ] Input system was already deterministic with 290 transitions.
Support contains 14 out of 170 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (9193 resets) in 3678 ms. (10 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (3850 resets) in 570 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (3749 resets) in 225 ms. (177 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3754 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3768 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3843 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3816 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3870 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (3760 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3783 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3842 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3749 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3887 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 333834 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :3 out of 12
Probabilistic random walk after 333834 steps, saw 138795 distinct states, run finished after 3012 ms. (steps per millisecond=110 ) properties seen :3
[2025-05-30 11:53:22] [INFO ] Invariant cache hit.
[2025-05-30 11:53:22] [INFO ] State equation strengthened by 123 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 62/71 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/109 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 194/303 variables, 109/111 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 27/138 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 8 (OVERLAPS) 148/451 variables, 56/194 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 92/286 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/286 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/460 variables, 5/291 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 4/295 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:23] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 30 ms to minimize.
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 460/460 variables, and 296 constraints, problems are : Problem set: 9 solved, 0 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 8 simplifications.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:53:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-05-30 11:53:23] [INFO ] Flatten gal took : 38 ms
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:53:23] [INFO ] Flatten gal took : 41 ms
[2025-05-30 11:53:23] [INFO ] Input system was already deterministic with 290 transitions.
Support contains 3 out of 170 places (down from 5) after GAL structural reductions.
Computed a total of 5 stabilizing places and 22 stable transitions
Graph (complete) has 644 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 290/290 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 168 transition count 285
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 24 place count 151 transition count 262
Iterating global reduction 1 with 17 rules applied. Total rules applied 41 place count 151 transition count 262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 47 place count 151 transition count 256
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 56 place count 142 transition count 241
Iterating global reduction 2 with 9 rules applied. Total rules applied 65 place count 142 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 142 transition count 237
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 75 place count 136 transition count 218
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 136 transition count 218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 86 place count 136 transition count 213
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 91 place count 131 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 131 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 131 transition count 195
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 100 place count 129 transition count 193
Iterating global reduction 5 with 2 rules applied. Total rules applied 102 place count 129 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 104 place count 129 transition count 191
Applied a total of 104 rules in 33 ms. Remains 129 /170 variables (removed 41) and now considering 191/290 (removed 99) transitions.
// Phase 1: matrix 191 rows 129 cols
[2025-05-30 11:53:23] [INFO ] Computed 2 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:53:23] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-30 11:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:53:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-05-30 11:53:24] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-05-30 11:53:24] [INFO ] Invariant cache hit.
[2025-05-30 11:53:24] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/320 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 68/199 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 199 constraints, problems are : Problem set: 0 solved, 190 unsolved in 14278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/320 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 68/199 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 190/389 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 389 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44577ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 44582ms
Starting structural reductions in LTL mode, iteration 1 : 129/170 places, 191/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45689 ms. Remains : 129/170 places, 191/290 transitions.
[2025-05-30 11:54:09] [INFO ] Flatten gal took : 23 ms
[2025-05-30 11:54:09] [INFO ] Flatten gal took : 22 ms
[2025-05-30 11:54:09] [INFO ] Input system was already deterministic with 191 transitions.
[2025-05-30 11:54:09] [INFO ] Flatten gal took : 28 ms
[2025-05-30 11:54:09] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:54:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality12424916916611048539.gal : 11 ms
[2025-05-30 11:54:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6719864618631026965.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12424916916611048539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6719864618631026965.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,195798,4.14747,101812,2,11845,5,266781,6,0,707,320174,0
Converting to forward existential form...Done !
original formula: AF((EG((p202>0)) * AX(EF((l1678>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((p202>0)) * !(EX(!(E(TRUE U (l1678>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t71, t72, t76, t77, t78, t86, t87, t92, t93, t94, t95, t100, t101, t102...611
(forward)formula 0,0,23.0175,454208,1,0,530,1.95636e+06,414,289,5011,1.42364e+06,613
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 290/290 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 168 transition count 285
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 26 place count 149 transition count 260
Iterating global reduction 1 with 19 rules applied. Total rules applied 45 place count 149 transition count 260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 52 place count 149 transition count 253
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 139 transition count 236
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 139 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 77 place count 139 transition count 231
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 84 place count 132 transition count 205
Iterating global reduction 3 with 7 rules applied. Total rules applied 91 place count 132 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 96 place count 132 transition count 200
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 102 place count 126 transition count 177
Iterating global reduction 4 with 6 rules applied. Total rules applied 108 place count 126 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 110 place count 126 transition count 175
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 112 place count 124 transition count 173
Iterating global reduction 5 with 2 rules applied. Total rules applied 114 place count 124 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 116 place count 124 transition count 171
Applied a total of 116 rules in 21 ms. Remains 124 /170 variables (removed 46) and now considering 171/290 (removed 119) transitions.
// Phase 1: matrix 171 rows 124 cols
[2025-05-30 11:54:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:32] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-05-30 11:54:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 11:54:34] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1624 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-05-30 11:54:34] [INFO ] Invariant cache hit.
[2025-05-30 11:54:34] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:45] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:45] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 12 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/295 variables, and 180 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/295 variables, 124/128 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 52/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 170/350 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 350 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 124/170 places, 171/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61822 ms. Remains : 124/170 places, 171/290 transitions.
[2025-05-30 11:55:34] [INFO ] Flatten gal took : 18 ms
[2025-05-30 11:55:34] [INFO ] Flatten gal took : 17 ms
[2025-05-30 11:55:34] [INFO ] Input system was already deterministic with 171 transitions.
[2025-05-30 11:55:34] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:55:34] [INFO ] Flatten gal took : 17 ms
[2025-05-30 11:55:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7239374164066526336.gal : 6 ms
[2025-05-30 11:55:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality17814547399726962521.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7239374164066526336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17814547399726962521.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,186662,3.63932,84056,2,11027,5,218165,6,0,667,265361,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,3.64578,84056,1,0,6,218165,7,1,903,265361,1
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 290/290 transitions.
Graph (complete) has 644 edges and 170 vertex of which 168 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 168 transition count 285
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 24 place count 150 transition count 261
Iterating global reduction 1 with 18 rules applied. Total rules applied 42 place count 150 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 49 place count 150 transition count 254
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 141 transition count 242
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 141 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 141 transition count 237
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 135 transition count 212
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 135 transition count 212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 89 place count 135 transition count 207
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 94 place count 130 transition count 185
Iterating global reduction 4 with 5 rules applied. Total rules applied 99 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 128 transition count 183
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 128 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 105 place count 128 transition count 181
Applied a total of 105 rules in 56 ms. Remains 128 /170 variables (removed 42) and now considering 181/290 (removed 109) transitions.
// Phase 1: matrix 181 rows 128 cols
[2025-05-30 11:55:38] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:38] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-30 11:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-30 11:55:38] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:55:38] [INFO ] Redundant transitions in 13 ms returned []
Running 180 sub problems to find dead transitions.
[2025-05-30 11:55:38] [INFO ] Invariant cache hit.
[2025-05-30 11:55:39] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/309 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 53/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 183 constraints, problems are : Problem set: 0 solved, 180 unsolved in 14115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/309 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 53/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 180/363 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 363 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44299ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 44300ms
Starting structural reductions in SI_CTL mode, iteration 1 : 128/170 places, 181/290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45050 ms. Remains : 128/170 places, 181/290 transitions.
[2025-05-30 11:56:23] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:56:23] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:56:23] [INFO ] Input system was already deterministic with 181 transitions.
[2025-05-30 11:56:23] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:56:23] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:56:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality11699182541183830537.gal : 2 ms
[2025-05-30 11:56:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality13143801671795282124.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11699182541183830537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13143801671795282124.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,244774,5.30735,115204,2,12859,5,311793,6,0,693,364544,0
Converting to forward existential form...Done !
original formula: AF(AG((p443>0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p443>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t102, t104, t113...605
(forward)formula 0,0,19.4524,348320,1,0,501,1.24819e+06,390,254,5004,1.18421e+06,513
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-05-30 11:56:43] [INFO ] Flatten gal took : 23 ms
[2025-05-30 11:56:43] [INFO ] Flatten gal took : 23 ms
Total runtime 242512 ms.
BK_STOP 1748606203165
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-d2m05"
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-5832"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m05, 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 r058-smll-174854063600121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 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.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 '
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 ;