fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of GreatSPN+red for DBSingleClientW-PT-d2m06

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1471.199 179673.00 243732.00 547.80 FFFTTFFTTFFFFFTF 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.r091-tall-171624188000563.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 greatspnxred
Input is DBSingleClientW-PT-d2m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188000563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 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 1.6M 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-d2m06-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716299960177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:59:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:59:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:59:21] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-21 13:59:21] [INFO ] Transformed 4763 places.
[2024-05-21 13:59:21] [INFO ] Transformed 2478 transitions.
[2024-05-21 13:59:21] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 28 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 634 place count 748 transition count 1211
Iterating global reduction 1 with 389 rules applied. Total rules applied 1023 place count 748 transition count 1211
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1032 place count 748 transition count 1202
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1346 place count 434 transition count 888
Iterating global reduction 2 with 314 rules applied. Total rules applied 1660 place count 434 transition count 888
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1672 place count 434 transition count 876
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1910 place count 196 transition count 543
Iterating global reduction 3 with 238 rules applied. Total rules applied 2148 place count 196 transition count 543
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2359 place count 196 transition count 332
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2382 place count 173 transition count 288
Iterating global reduction 4 with 23 rules applied. Total rules applied 2405 place count 173 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2411 place count 173 transition count 282
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 2424 place count 160 transition count 269
Iterating global reduction 5 with 13 rules applied. Total rules applied 2437 place count 160 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2439 place count 160 transition count 267
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2450 place count 149 transition count 256
Iterating global reduction 6 with 11 rules applied. Total rules applied 2461 place count 149 transition count 256
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2471 place count 149 transition count 246
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2476 place count 144 transition count 216
Iterating global reduction 7 with 5 rules applied. Total rules applied 2481 place count 144 transition count 216
Applied a total of 2481 rules in 202 ms. Remains 144 /1183 variables (removed 1039) and now considering 216/2478 (removed 2262) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-21 13:59:22] [INFO ] Computed 2 invariants in 17 ms
[2024-05-21 13:59:22] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 13:59:22] [INFO ] Invariant cache hit.
[2024-05-21 13:59:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 13:59:22] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-21 13:59:22] [INFO ] Invariant cache hit.
[2024-05-21 13:59:22] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 73/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 219 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 73/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 215/434 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 434 constraints, problems are : Problem set: 0 solved, 215 unsolved in 16714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 24620ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 24643ms
Starting structural reductions in LTL mode, iteration 1 : 144/1183 places, 216/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25629 ms. Remains : 144/1183 places, 216/2478 transitions.
Support contains 7 out of 144 places after structural reductions.
[2024-05-21 13:59:47] [INFO ] Flatten gal took : 42 ms
[2024-05-21 13:59:47] [INFO ] Flatten gal took : 17 ms
[2024-05-21 13:59:47] [INFO ] Input system was already deterministic with 216 transitions.
RANDOM walk for 40000 steps (9199 resets) in 2373 ms. (16 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (3668 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3757 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3840 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3880 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
[2024-05-21 13:59:48] [INFO ] Invariant cache hit.
[2024-05-21 13:59:48] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/62 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 36/98 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 157/255 variables, 98/100 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 14/114 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 8 (OVERLAPS) 99/354 variables, 43/157 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 56/213 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/360 variables, 3/216 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 3/219 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/219 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/360 variables, 0/219 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 219 constraints, problems are : Problem set: 2 solved, 2 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/98 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 157/255 variables, 98/100 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 14/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/115 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 99/354 variables, 43/158 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 56/214 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/215 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/215 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/360 variables, 3/218 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 3/221 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/221 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/360 variables, 0/221 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 221 constraints, problems are : Problem set: 2 solved, 2 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 491ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 216/216 transitions.
Graph (complete) has 488 edges and 144 vertex of which 143 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 143 transition count 213
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 139 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 139 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 139 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 136 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 136 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 136 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 134 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 134 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 134 transition count 197
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 132 transition count 191
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 132 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 131 transition count 189
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 131 transition count 189
Applied a total of 32 rules in 42 ms. Remains 131 /144 variables (removed 13) and now considering 189/216 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 131/144 places, 189/216 transitions.
RANDOM walk for 40000 steps (9201 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3821 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3860 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 20528 steps, run visited all 2 properties in 108 ms. (steps per millisecond=190 )
Probabilistic random walk after 20528 steps, saw 9403 distinct states, run finished after 112 ms. (steps per millisecond=183 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 523 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 207
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 138 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 134 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 134 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 134 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 132 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 132 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 132 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 130 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 129 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 129 transition count 181
Applied a total of 36 rules in 14 ms. Remains 129 /144 variables (removed 15) and now considering 181/216 (removed 35) transitions.
// Phase 1: matrix 181 rows 129 cols
[2024-05-21 13:59:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:59:49] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 13:59:49] [INFO ] Invariant cache hit.
[2024-05-21 13:59:49] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 13:59:50] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-21 13:59:50] [INFO ] Invariant cache hit.
[2024-05-21 13:59:50] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/310 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 54/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 185 constraints, problems are : Problem set: 0 solved, 180 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/310 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 54/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 180/365 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 365 constraints, problems are : Problem set: 0 solved, 180 unsolved in 13808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
After SMT, in 18781ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 18785ms
Starting structural reductions in LTL mode, iteration 1 : 129/144 places, 181/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19136 ms. Remains : 129/144 places, 181/216 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 41 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-03 finished in 20030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 139 transition count 208
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 139 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 139 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 135 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 135 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 135 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 132 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 132 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 132 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 31 place count 129 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 129 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 127 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 127 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 127 transition count 182
Applied a total of 39 rules in 37 ms. Remains 127 /144 variables (removed 17) and now considering 182/216 (removed 34) transitions.
// Phase 1: matrix 182 rows 127 cols
[2024-05-21 14:00:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 14:00:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 14:00:09] [INFO ] Invariant cache hit.
[2024-05-21 14:00:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 14:00:10] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-21 14:00:10] [INFO ] Redundant transitions in 6 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 14:00:10] [INFO ] Invariant cache hit.
[2024-05-21 14:00:10] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 189 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 370 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10993 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 15949ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 15952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/144 places, 182/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16332 ms. Remains : 127/144 places, 182/216 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-06
Product exploration explored 100000 steps with 23093 reset in 224 ms.
Product exploration explored 100000 steps with 23078 reset in 160 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9134 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3753 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 43064 steps, run visited all 1 properties in 83 ms. (steps per millisecond=518 )
Probabilistic random walk after 43064 steps, saw 20127 distinct states, run finished after 84 ms. (steps per millisecond=512 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 14:00:27] [INFO ] Invariant cache hit.
[2024-05-21 14:00:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 14:00:27] [INFO ] Invariant cache hit.
[2024-05-21 14:00:27] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 14:00:27] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-21 14:00:27] [INFO ] Redundant transitions in 7 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 14:00:27] [INFO ] Invariant cache hit.
[2024-05-21 14:00:27] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 189 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4840 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 370 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10766 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 15910ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 15914ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16280 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9224 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3879 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 43064 steps, run visited all 1 properties in 79 ms. (steps per millisecond=545 )
Probabilistic random walk after 43064 steps, saw 20127 distinct states, run finished after 79 ms. (steps per millisecond=545 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22925 reset in 141 ms.
Product exploration explored 100000 steps with 22888 reset in 154 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 14:00:44] [INFO ] Invariant cache hit.
[2024-05-21 14:00:44] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 14:00:44] [INFO ] Invariant cache hit.
[2024-05-21 14:00:44] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 14:00:44] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-21 14:00:44] [INFO ] Redundant transitions in 3 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 14:00:44] [INFO ] Invariant cache hit.
[2024-05-21 14:00:44] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 189 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 370 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 15900ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 15904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16283 ms. Remains : 127/127 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-06 finished in 50748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 139 transition count 208
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 139 transition count 208
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 139 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 136 transition count 196
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 136 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 134 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 134 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 132 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 132 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 130 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 130 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 130 transition count 184
Applied a total of 32 rules in 8 ms. Remains 130 /144 variables (removed 14) and now considering 184/216 (removed 32) transitions.
// Phase 1: matrix 184 rows 130 cols
[2024-05-21 14:01:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 14:01:00] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 14:01:00] [INFO ] Invariant cache hit.
[2024-05-21 14:01:00] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 14:01:00] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-21 14:01:00] [INFO ] Invariant cache hit.
[2024-05-21 14:01:00] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/314 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 192 constraints, problems are : Problem set: 0 solved, 183 unsolved in 5207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/314 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 183/375 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 375 constraints, problems are : Problem set: 0 solved, 183 unsolved in 13014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
After SMT, in 18511ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 18514ms
Starting structural reductions in LTL mode, iteration 1 : 130/144 places, 184/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18930 ms. Remains : 130/144 places, 184/216 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 467 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-08 finished in 19394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-21 14:01:20] [INFO ] Flatten gal took : 24 ms
[2024-05-21 14:01:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-21 14:01:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 216 transitions and 851 arcs took 7 ms.
Total runtime 118804 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d2m06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 144
TRANSITIONS: 216
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 738
MODEL NAME: /home/mcc/execution/415/model
144 places, 216 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716300139850

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-d2m06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d2m06, 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 r091-tall-171624188000563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m06.tgz
mv DBSingleClientW-PT-d2m06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;