fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624189500529
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DBSingleClientW-PT-d1m09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3104.651 523241.00 556661.00 1724.00 FFFFTFTTFFTFTFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 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-d1m09-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m09-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716322287087

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-d1m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 20:11:28] [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 20:11:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:11:28] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-21 20:11:28] [INFO ] Transformed 1440 places.
[2024-05-21 20:11:28] [INFO ] Transformed 672 transitions.
[2024-05-21 20:11:28] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 327 transition count 611
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 174 place count 234 transition count 335
Iterating global reduction 1 with 93 rules applied. Total rules applied 267 place count 234 transition count 335
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 271 place count 234 transition count 331
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 340 place count 165 transition count 262
Iterating global reduction 2 with 69 rules applied. Total rules applied 409 place count 165 transition count 262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 415 place count 165 transition count 256
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 449 place count 131 transition count 205
Iterating global reduction 3 with 34 rules applied. Total rules applied 483 place count 131 transition count 205
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 500 place count 131 transition count 188
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 509 place count 122 transition count 171
Iterating global reduction 4 with 9 rules applied. Total rules applied 518 place count 122 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 520 place count 122 transition count 169
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 525 place count 117 transition count 164
Iterating global reduction 5 with 5 rules applied. Total rules applied 530 place count 117 transition count 164
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 535 place count 112 transition count 159
Iterating global reduction 5 with 5 rules applied. Total rules applied 540 place count 112 transition count 159
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 541 place count 111 transition count 157
Iterating global reduction 5 with 1 rules applied. Total rules applied 542 place count 111 transition count 157
Applied a total of 542 rules in 83 ms. Remains 111 /347 variables (removed 236) and now considering 157/672 (removed 515) transitions.
// Phase 1: matrix 157 rows 111 cols
[2024-05-21 20:11:28] [INFO ] Computed 2 invariants in 15 ms
[2024-05-21 20:11:28] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-21 20:11:28] [INFO ] Invariant cache hit.
[2024-05-21 20:11:28] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 20:11:29] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-21 20:11:29] [INFO ] Invariant cache hit.
[2024-05-21 20:11:29] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/267 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 53/165 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/268 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 166 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 53/53 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/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/267 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 53/165 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 150/315 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 1/268 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 322 constraints, problems are : Problem set: 0 solved, 156 unsolved in 12601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
After SMT, in 19465ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 19485ms
Starting structural reductions in LTL mode, iteration 1 : 111/347 places, 157/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20054 ms. Remains : 111/347 places, 157/672 transitions.
Support contains 12 out of 111 places after structural reductions.
[2024-05-21 20:11:48] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-21 20:11:48] [INFO ] Flatten gal took : 36 ms
[2024-05-21 20:11:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:11:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:11:48] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:11:48] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 3 out of 111 places (down from 12) after GAL structural reductions.
RANDOM walk for 40000 steps (9273 resets) in 1605 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3993 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3892 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (3849 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 791694 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 3
Probabilistic random walk after 791694 steps, saw 298417 distinct states, run finished after 3004 ms. (steps per millisecond=263 ) properties seen :0
[2024-05-21 20:11:52] [INFO ] Invariant cache hit.
[2024-05-21 20:11:52] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 42/268 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/111 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 2 simplifications.
[2024-05-21 20:11:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 20:11:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:11:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:11:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:11:52] [INFO ] Input system was already deterministic with 157 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 385 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 111/111 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 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 100 transition count 141
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 100 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 100 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 93 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 93 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 93 transition count 125
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 47 place count 87 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 87 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 57 place count 87 transition count 115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 61 place count 83 transition count 105
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 83 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 69 place count 83 transition count 101
Applied a total of 69 rules in 10 ms. Remains 83 /111 variables (removed 28) and now considering 101/157 (removed 56) transitions.
// Phase 1: matrix 101 rows 83 cols
[2024-05-21 20:11:52] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 20:11:52] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 20:11:52] [INFO ] Invariant cache hit.
[2024-05-21 20:11:52] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:11:52] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:11:52] [INFO ] Invariant cache hit.
[2024-05-21 20:11:52] [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 1682 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 3282 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 5066ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5071ms
Starting structural reductions in LTL mode, iteration 1 : 83/111 places, 101/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5283 ms. Remains : 83/111 places, 101/157 transitions.
[2024-05-21 20:11:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:11:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:11:57] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:11:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:11:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:11:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14562402668898690872.gal : 3 ms
[2024-05-21 20:11:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality11349152956532200388.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/CTLCardinality14562402668898690872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11349152956532200388.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,3.97797e+07,15.2717,380888,2,30603,5,1.22212e+06,6,0,433,1.47388e+06,0


Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = 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,1,21.4864,382936,1,0,200,1.43286e+06,223,79,3060,1.47388e+06,218
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 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 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 100 transition count 141
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 100 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 100 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 93 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 93 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 93 transition count 125
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 47 place count 87 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 87 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 57 place count 87 transition count 115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 61 place count 83 transition count 105
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 83 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 69 place count 83 transition count 101
Applied a total of 69 rules in 15 ms. Remains 83 /111 variables (removed 28) and now considering 101/157 (removed 56) transitions.
[2024-05-21 20:12:19] [INFO ] Invariant cache hit.
[2024-05-21 20:12:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 20:12:19] [INFO ] Invariant cache hit.
[2024-05-21 20:12:19] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:12:19] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:12:19] [INFO ] Invariant cache hit.
[2024-05-21 20:12:19] [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 1688 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 3248 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 5016ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5018ms
Starting structural reductions in LTL mode, iteration 1 : 83/111 places, 101/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5216 ms. Remains : 83/111 places, 101/157 transitions.
[2024-05-21 20:12:24] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:12:24] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:12:24] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:12:24] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:12:24] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:12:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality5057956962984394210.gal : 2 ms
[2024-05-21 20:12:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality7405558603994235915.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5057956962984394210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7405558603994235915.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,3.97797e+07,15.2605,381596,2,30603,5,1.22212e+06,6,0,433,1.47388e+06,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
Detected timeout of ITS tools.
[2024-05-21 20:12:54] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:12:54] [INFO ] Applying decomposition
[2024-05-21 20:12:54] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16774746242676977661.txt' '-o' '/tmp/graph16774746242676977661.bin' '-w' '/tmp/graph16774746242676977661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16774746242676977661.bin' '-l' '-1' '-v' '-w' '/tmp/graph16774746242676977661.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:12:54] [INFO ] Decomposing Gal with order
[2024-05-21 20:12:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:12:55] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-21 20:12:55] [INFO ] Flatten gal took : 66 ms
[2024-05-21 20:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 14 ms.
[2024-05-21 20:12:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality16223934849827143646.gal : 3 ms
[2024-05-21 20:12:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality8341189384164456470.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16223934849827143646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8341189384164456470.ctl'

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 -...263
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,3.97797e+07,3.16771,95388,2268,1207,129273,14510,349,381692,107,182748,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, t6, t11, t45, t63, t71, t72, t73, t74, t75, t82, t83, t84, t85, t86, t87, t88, t89, t90, ...368
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 111/111 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 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 100 transition count 141
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 100 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 100 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 93 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 93 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 93 transition count 125
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 47 place count 87 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 87 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 57 place count 87 transition count 115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 61 place count 83 transition count 105
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 83 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 69 place count 83 transition count 101
Applied a total of 69 rules in 7 ms. Remains 83 /111 variables (removed 28) and now considering 101/157 (removed 56) transitions.
[2024-05-21 20:13:25] [INFO ] Invariant cache hit.
[2024-05-21 20:13:25] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-21 20:13:25] [INFO ] Invariant cache hit.
[2024-05-21 20:13:25] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:13:25] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:13:25] [INFO ] Invariant cache hit.
[2024-05-21 20:13:25] [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 1719 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 3186 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 4991ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4992ms
Starting structural reductions in LTL mode, iteration 1 : 83/111 places, 101/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5523 ms. Remains : 83/111 places, 101/157 transitions.
[2024-05-21 20:13:30] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:13:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:13:30] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:13:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:13:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:13:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12176182912197282263.gal : 1 ms
[2024-05-21 20:13:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality6352189324104355613.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12176182912197282263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6352189324104355613.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.97797e+07,18.7207,380508,2,30603,5,1.22212e+06,6,0,433,1.47388e+06,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,18.7243,380508,1,0,6,1.22212e+06,7,1,580,1.47388e+06,1
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 20:13:49] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:13:49] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:13:49] [INFO ] Applying decomposition
[2024-05-21 20:13:49] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16715216550698493901.txt' '-o' '/tmp/graph16715216550698493901.bin' '-w' '/tmp/graph16715216550698493901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16715216550698493901.bin' '-l' '-1' '-v' '-w' '/tmp/graph16715216550698493901.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:13:49] [INFO ] Decomposing Gal with order
[2024-05-21 20:13:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:13:49] [INFO ] Removed a total of 179 redundant transitions.
[2024-05-21 20:13:49] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:13:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 7 ms.
[2024-05-21 20:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13684087269147813522.gal : 4 ms
[2024-05-21 20:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7528335895265138886.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/CTLCardinality13684087269147813522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7528335895265138886.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.82214e+08,94.2088,1664660,7954,3945,1.19831e+06,622874,490,9.29053e+06,114,7.00799e+06,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 t5, t12, t17, t52, t53, t54, t55, t56, t57, t58, t60, t61, t62, t63, t64, t75, t89, t92, t101...635
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,380.1,2444692,1,0,1.81599e+06,622874,1254,1.85033e+07,387,7.25163e+06,2640544
FORMULA DBSingleClientW-PT-d1m09-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 522109 ms.

BK_STOP 1716322810328

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m09"
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-d1m09, 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-171624189500529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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