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

About the Execution of LTSMin+red for DBSingleClientW-PT-d2m05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
888.123 119655.00 147393.00 485.60 TFFTFTFFFTTFTFTF 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.r480-tall-171624189500555.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 ltsminxred
Input is DBSingleClientW-PT-d2m05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-d2m05-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717190327771

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:18:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:18:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:18:49] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-31 21:18:49] [INFO ] Transformed 4763 places.
[2024-05-31 21:18:49] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:18:49] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 3580 places in 30 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1138 transition count 2282
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 631 place count 748 transition count 1212
Iterating global reduction 1 with 390 rules applied. Total rules applied 1021 place count 748 transition count 1212
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1030 place count 748 transition count 1203
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1344 place count 434 transition count 889
Iterating global reduction 2 with 314 rules applied. Total rules applied 1658 place count 434 transition count 889
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1670 place count 434 transition count 877
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1910 place count 194 transition count 535
Iterating global reduction 3 with 240 rules applied. Total rules applied 2150 place count 194 transition count 535
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2361 place count 194 transition count 324
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2386 place count 169 transition count 278
Iterating global reduction 4 with 25 rules applied. Total rules applied 2411 place count 169 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2417 place count 169 transition count 272
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2434 place count 152 transition count 255
Iterating global reduction 5 with 17 rules applied. Total rules applied 2451 place count 152 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2455 place count 152 transition count 251
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2469 place count 138 transition count 237
Iterating global reduction 6 with 14 rules applied. Total rules applied 2483 place count 138 transition count 237
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2496 place count 138 transition count 224
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2500 place count 134 transition count 205
Iterating global reduction 7 with 4 rules applied. Total rules applied 2504 place count 134 transition count 205
Applied a total of 2504 rules in 193 ms. Remains 134 /1183 variables (removed 1049) and now considering 205/2478 (removed 2273) transitions.
// Phase 1: matrix 205 rows 134 cols
[2024-05-31 21:18:50] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 21:18:50] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-31 21:18:50] [INFO ] Invariant cache hit.
[2024-05-31 21:18:50] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-31 21:18:50] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-31 21:18:50] [INFO ] Invariant cache hit.
[2024-05-31 21:18:50] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/338 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 82/217 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-31 21:18:54] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 19 ms to minimize.
[2024-05-31 21:18:54] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 3 ms to minimize.
[2024-05-31 21:18:55] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-31 21:18:55] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-31 21:18:55] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 1/339 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 223 constraints, problems are : Problem set: 0 solved, 204 unsolved in 11949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/338 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 82/222 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 189/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 1/339 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 15/427 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 13 (OVERLAPS) 0/339 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 427 constraints, problems are : Problem set: 0 solved, 204 unsolved in 23512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 5/5 constraints]
After SMT, in 35928ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 35948ms
Starting structural reductions in LTL mode, iteration 1 : 134/1183 places, 205/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36821 ms. Remains : 134/1183 places, 205/2478 transitions.
Support contains 3 out of 134 places after structural reductions.
[2024-05-31 21:19:26] [INFO ] Flatten gal took : 41 ms
[2024-05-31 21:19:26] [INFO ] Flatten gal took : 20 ms
[2024-05-31 21:19:26] [INFO ] Input system was already deterministic with 205 transitions.
RANDOM walk for 40000 steps (9180 resets) in 1945 ms. (20 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3783 resets) in 395 ms. (101 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (3894 resets) in 399 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (3836 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
Probably explored full state space saw : 207412 states, properties seen :2
Probabilistic random walk after 515638 steps, saw 207412 distinct states, run finished after 1107 ms. (steps per millisecond=465 ) properties seen :2
Explored full state space saw : 208804 states, properties seen :0
Exhaustive walk after 517947 steps, saw 208804 distinct states, run finished after 906 ms. (steps per millisecond=571 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 490 edges and 134 vertex of which 132 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 205/205 transitions.
Graph (complete) has 490 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 130 transition count 189
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 130 transition count 189
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 129 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 129 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 128 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 127 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 127 transition count 179
Applied a total of 16 rules in 37 ms. Remains 127 /134 variables (removed 7) and now considering 179/205 (removed 26) transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-31 21:19:30] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:19:30] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-31 21:19:30] [INFO ] Invariant cache hit.
[2024-05-31 21:19:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:19:30] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-31 21:19:30] [INFO ] Redundant transitions in 6 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:19:30] [INFO ] Invariant cache hit.
[2024-05-31 21:19:30] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10746 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15873ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15882ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/134 places, 179/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16427 ms. Remains : 127/134 places, 179/205 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLCardinality-02
Product exploration explored 100000 steps with 23108 reset in 296 ms.
Product exploration explored 100000 steps with 22981 reset in 228 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 457 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 129 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 49 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9188 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3930 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44852 steps, run visited all 1 properties in 107 ms. (steps per millisecond=419 )
Probabilistic random walk after 44852 steps, saw 20919 distinct states, run finished after 123 ms. (steps per millisecond=364 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 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)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 23 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-31 21:19:47] [INFO ] Invariant cache hit.
[2024-05-31 21:19:48] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-31 21:19:48] [INFO ] Invariant cache hit.
[2024-05-31 21:19:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:19:48] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-31 21:19:48] [INFO ] Redundant transitions in 7 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:19:48] [INFO ] Invariant cache hit.
[2024-05-31 21:19:48] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4514 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15338ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15341ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15997 ms. Remains : 127/127 places, 179/179 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 457 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 83 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)]
RANDOM walk for 40000 steps (9164 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3854 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44852 steps, run visited all 1 properties in 212 ms. (steps per millisecond=211 )
Probabilistic random walk after 44852 steps, saw 20919 distinct states, run finished after 212 ms. (steps per millisecond=211 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22870 reset in 159 ms.
Product exploration explored 100000 steps with 22986 reset in 164 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-31 21:20:05] [INFO ] Invariant cache hit.
[2024-05-31 21:20:05] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-31 21:20:05] [INFO ] Invariant cache hit.
[2024-05-31 21:20:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:20:05] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-31 21:20:05] [INFO ] Redundant transitions in 2 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:20:05] [INFO ] Invariant cache hit.
[2024-05-31 21:20:05] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10965 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15609ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15612ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15993 ms. Remains : 127/127 places, 179/179 transitions.
Treatment of property DBSingleClientW-PT-d2m05-LTLCardinality-02 finished in 51116 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' '!(G(F(p0)))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 205/205 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 132 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 130 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 130 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 130 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 128 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 128 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 128 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 127 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 127 transition count 186
Applied a total of 16 rules in 64 ms. Remains 127 /134 variables (removed 7) and now considering 186/205 (removed 19) transitions.
// Phase 1: matrix 186 rows 127 cols
[2024-05-31 21:20:21] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:20:21] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 21:20:21] [INFO ] Invariant cache hit.
[2024-05-31 21:20:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-31 21:20:21] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-31 21:20:21] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 21:20:21] [INFO ] Invariant cache hit.
[2024-05-31 21:20:21] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 1/313 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 185 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/313 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 196 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 170/365 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 15/381 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/313 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 381 constraints, problems are : Problem set: 0 solved, 185 unsolved in 15955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 24931ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 24934ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/134 places, 186/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25542 ms. Remains : 127/134 places, 186/205 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLCardinality-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLCardinality-06 finished in 25652 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-31 21:20:46] [INFO ] Flatten gal took : 26 ms
[2024-05-31 21:20:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 21:20:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 134 places, 205 transitions and 806 arcs took 4 ms.
Total runtime 117868 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DBSingleClientW-PT-d2m05-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717190447426

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name DBSingleClientW-PT-d2m05-LTLCardinality-02
ltl formula formula --ltl=/tmp/734/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 134 places, 205 transitions and 806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/734/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/734/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/734/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/734/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 134 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 135, there are 209 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~44!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5752
pnml2lts-mc( 0/ 4): unique states count: 6091
pnml2lts-mc( 0/ 4): unique transitions count: 13047
pnml2lts-mc( 0/ 4): - self-loop count: 4744
pnml2lts-mc( 0/ 4): - claim dead count: 1366
pnml2lts-mc( 0/ 4): - claim found count: 54
pnml2lts-mc( 0/ 4): - claim success count: 6127
pnml2lts-mc( 0/ 4): - cum. max stack depth: 283
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6127 states 13209 transitions, fanout: 2.156
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 102117, Transitions per second: 220150
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 12.8 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 205 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d2m05, 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 r480-tall-171624189500555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 execution
cd execution
if [ "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 ;