Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500075.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-d1m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K 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 432K 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-d1m06-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748570102608

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 01:55:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 01:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:55:05] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2025-05-30 01:55:05] [INFO ] Transformed 1440 places.
[2025-05-30 01:55:05] [INFO ] Transformed 672 transitions.
[2025-05-30 01:55:05] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 195 place count 232 transition count 346
Iterating global reduction 1 with 94 rules applied. Total rules applied 289 place count 232 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 293 place count 232 transition count 342
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 365 place count 160 transition count 270
Iterating global reduction 2 with 72 rules applied. Total rules applied 437 place count 160 transition count 270
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 442 place count 160 transition count 265
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 481 place count 121 transition count 204
Iterating global reduction 3 with 39 rules applied. Total rules applied 520 place count 121 transition count 204
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 549 place count 121 transition count 175
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 559 place count 111 transition count 157
Iterating global reduction 4 with 10 rules applied. Total rules applied 569 place count 111 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 570 place count 111 transition count 156
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 577 place count 104 transition count 149
Iterating global reduction 5 with 7 rules applied. Total rules applied 584 place count 104 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 585 place count 104 transition count 148
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 591 place count 98 transition count 142
Iterating global reduction 6 with 6 rules applied. Total rules applied 597 place count 98 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 599 place count 98 transition count 140
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 600 place count 97 transition count 138
Iterating global reduction 7 with 1 rules applied. Total rules applied 601 place count 97 transition count 138
Applied a total of 601 rules in 188 ms. Remains 97 /347 variables (removed 250) and now considering 138/672 (removed 534) transitions.
// Phase 1: matrix 138 rows 97 cols
[2025-05-30 01:55:06] [INFO ] Computed 2 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:06] [INFO ] Implicit Places using invariants in 544 ms returned []
[2025-05-30 01:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:06] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 01:55:07] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2025-05-30 01:55:07] [INFO ] Invariant cache hit.
[2025-05-30 01:55:07] [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/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/235 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 151 constraints, problems are : Problem set: 0 solved, 137 unsolved in 9123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/235 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 137/288 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 288 constraints, problems are : Problem set: 0 solved, 137 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39619ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 39640ms
Starting structural reductions in LTL mode, iteration 1 : 97/347 places, 138/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41144 ms. Remains : 97/347 places, 138/672 transitions.
Support contains 6 out of 97 places after structural reductions.
[2025-05-30 01:55:47] [INFO ] Flatten gal took : 77 ms
[2025-05-30 01:55:47] [INFO ] Flatten gal took : 38 ms
[2025-05-30 01:55:47] [INFO ] Input system was already deterministic with 138 transitions.
RANDOM walk for 40000 steps (9188 resets) in 2643 ms. (15 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (3954 resets) in 350 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3957 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3843 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3919 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
[2025-05-30 01:55:48] [INFO ] Invariant cache hit.
[2025-05-30 01:55:48] [INFO ] State equation strengthened by 52 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 104/171 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 8 (OVERLAPS) 58/229 variables, 27/114 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 31/145 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/235 variables, 3/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/235 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 151 constraints, problems are : Problem set: 1 solved, 3 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/66 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 98/164 variables, 66/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 12/80 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 1/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 65/229 variables, 28/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 37/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/235 variables, 3/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 3/154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/235 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 154 constraints, problems are : Problem set: 1 solved, 3 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 783ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 449 ms.
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 138/138 transitions.
Graph (complete) has 311 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 96 transition count 135
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 94 transition count 126
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 94 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 94 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 93 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 92 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 92 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 92 transition count 122
Applied a total of 14 rules in 48 ms. Remains 92 /97 variables (removed 5) and now considering 122/138 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 92/97 places, 122/138 transitions.
RANDOM walk for 40000 steps (9139 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3947 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3833 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3898 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 30177 steps, run visited all 3 properties in 223 ms. (steps per millisecond=135 )
Probabilistic random walk after 30177 steps, saw 13254 distinct states, run finished after 231 ms. (steps per millisecond=130 ) properties seen :3
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 339 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 138/138 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 93 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 93 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 93 transition count 125
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 90 transition count 122
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 90 transition count 122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 87 transition count 115
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 87 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 86 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 85 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 85 transition count 109
Applied a total of 30 rules in 45 ms. Remains 85 /97 variables (removed 12) and now considering 109/138 (removed 29) transitions.
// Phase 1: matrix 109 rows 85 cols
[2025-05-30 01:55:50] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:50] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-30 01:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 01:55:51] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:55:51] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-05-30 01:55:51] [INFO ] Invariant cache hit.
[2025-05-30 01:55:51] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 125 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 108/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 233 constraints, problems are : Problem set: 0 solved, 108 unsolved in 22989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27598ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 27600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/97 places, 109/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28273 ms. Remains : 85/97 places, 109/138 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLCardinality-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLCardinality-03 finished in 28627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 138/138 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 93 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 93 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 93 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 90 transition count 116
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 90 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 88 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 88 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 111
Applied a total of 23 rules in 18 ms. Remains 88 /97 variables (removed 9) and now considering 111/138 (removed 27) transitions.
// Phase 1: matrix 111 rows 88 cols
[2025-05-30 01:56:19] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:19] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-30 01:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:19] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-30 01:56:19] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:56:19] [INFO ] Redundant transitions in 6 ms returned []
Running 110 sub problems to find dead transitions.
[2025-05-30 01:56:19] [INFO ] Invariant cache hit.
[2025-05-30 01:56:19] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 123 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 233 constraints, problems are : Problem set: 0 solved, 110 unsolved in 27149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32859ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 32861ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/97 places, 111/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33335 ms. Remains : 88/97 places, 111/138 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLCardinality-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLCardinality-06 finished in 33410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 138/138 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 92 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 92 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 88 transition count 114
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 88 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 85 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 85 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 84 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 83 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 83 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 83 transition count 101
Applied a total of 35 rules in 59 ms. Remains 83 /97 variables (removed 14) and now considering 101/138 (removed 37) transitions.
// Phase 1: matrix 101 rows 83 cols
[2025-05-30 01:56:52] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:52] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-30 01:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:52] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 01:56:53] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:56:53] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-30 01:56:53] [INFO ] Invariant cache hit.
[2025-05-30 01:56:53] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:56] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:56] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:56] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:57] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:57] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:57] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:57] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:57] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:57] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:59] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:59] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:56:59] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:57:00] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 129 constraints, problems are : Problem set: 0 solved, 100 unsolved in 12392 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: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 13/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 83/98 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 31/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 100/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 229 constraints, problems are : Problem set: 0 solved, 100 unsolved in 17312 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: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29773ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 29773ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/97 places, 101/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30406 ms. Remains : 83/97 places, 101/138 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLCardinality-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLCardinality-07 finished in 30470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 138/138 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 93 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 93 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 93 transition count 125
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 90 transition count 117
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 90 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 88 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 88 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 87 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 87 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 86 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 86 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 86 transition count 107
Applied a total of 27 rules in 8 ms. Remains 86 /97 variables (removed 11) and now considering 107/138 (removed 31) transitions.
// Phase 1: matrix 107 rows 86 cols
[2025-05-30 01:57:23] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:23] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-30 01:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:23] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 01:57:23] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-05-30 01:57:23] [INFO ] Invariant cache hit.
[2025-05-30 01:57:23] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 122 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 20819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26279ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 26280ms
Starting structural reductions in LTL mode, iteration 1 : 86/97 places, 107/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27049 ms. Remains : 86/97 places, 107/138 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLCardinality-10 finished in 27215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 138/138 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 93 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 90 transition count 118
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 90 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 88 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 88 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 87 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 87 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 86 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 86 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 86 transition count 107
Applied a total of 27 rules in 10 ms. Remains 86 /97 variables (removed 11) and now considering 107/138 (removed 31) transitions.
// Phase 1: matrix 107 rows 86 cols
[2025-05-30 01:57:50] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:50] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 01:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:50] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-30 01:57:50] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-05-30 01:57:50] [INFO ] Invariant cache hit.
[2025-05-30 01:57:50] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 121 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 106/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 106 unsolved in 23407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29579ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 29580ms
Starting structural reductions in LTL mode, iteration 1 : 86/97 places, 107/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30042 ms. Remains : 86/97 places, 107/138 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 32155 steps with 7378 reset in 304 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLCardinality-15 finished in 30464 ms.
All properties solved by simple procedures.
Total runtime 195765 ms.

BK_STOP 1748570300813

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-d1m06"
export BK_EXAMINATION="LTLCardinality"
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-d1m06, examination is LTLCardinality"
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-174854063500075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m06.tgz
mv DBSingleClientW-PT-d1m06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;