About the Execution of GreatSPN+red for MedleyA-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 646.304 | 121626.00 | 158167.00 | 502.10 | TFTTFFFFFFFFFFTF | 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.r575-smll-171734919500059.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 MedleyA-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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 MedleyA-PT-08-LTLCardinality-00
FORMULA_NAME MedleyA-PT-08-LTLCardinality-01
FORMULA_NAME MedleyA-PT-08-LTLCardinality-02
FORMULA_NAME MedleyA-PT-08-LTLCardinality-03
FORMULA_NAME MedleyA-PT-08-LTLCardinality-04
FORMULA_NAME MedleyA-PT-08-LTLCardinality-05
FORMULA_NAME MedleyA-PT-08-LTLCardinality-06
FORMULA_NAME MedleyA-PT-08-LTLCardinality-07
FORMULA_NAME MedleyA-PT-08-LTLCardinality-08
FORMULA_NAME MedleyA-PT-08-LTLCardinality-09
FORMULA_NAME MedleyA-PT-08-LTLCardinality-10
FORMULA_NAME MedleyA-PT-08-LTLCardinality-11
FORMULA_NAME MedleyA-PT-08-LTLCardinality-12
FORMULA_NAME MedleyA-PT-08-LTLCardinality-13
FORMULA_NAME MedleyA-PT-08-LTLCardinality-14
FORMULA_NAME MedleyA-PT-08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717355373338
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:09:35] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-02 19:09:35] [INFO ] Transformed 147 places.
[2024-06-02 19:09:35] [INFO ] Transformed 312 transitions.
[2024-06-02 19:09:35] [INFO ] Found NUPN structural information;
[2024-06-02 19:09:35] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 110 transition count 269
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 110 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 75 place count 110 transition count 266
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 82 place count 103 transition count 248
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 100 transition count 241
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 100 transition count 241
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 99 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 99 transition count 238
Applied a total of 97 rules in 170 ms. Remains 99 /147 variables (removed 48) and now considering 238/312 (removed 74) transitions.
// Phase 1: matrix 238 rows 99 cols
[2024-06-02 19:09:36] [INFO ] Computed 10 invariants in 24 ms
[2024-06-02 19:09:36] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-06-02 19:09:36] [INFO ] Invariant cache hit.
[2024-06-02 19:09:36] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-02 19:09:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/99 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 189 unsolved
[2024-06-02 19:09:39] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 18 ms to minimize.
[2024-06-02 19:09:39] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-06-02 19:09:40] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 3 ms to minimize.
[2024-06-02 19:09:40] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 ms to minimize.
[2024-06-02 19:09:40] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-06-02 19:09:40] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 2 ms to minimize.
[2024-06-02 19:09:41] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 7/17 constraints. Problems are: Problem set: 48 solved, 189 unsolved
[2024-06-02 19:09:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 238/337 variables, 99/117 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/117 constraints. Problems are: Problem set: 48 solved, 189 unsolved
[2024-06-02 19:09:47] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/337 variables, 1/118 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/118 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/118 constraints. Problems are: Problem set: 48 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 118 constraints, problems are : Problem set: 48 solved, 189 unsolved in 14206 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 48 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 9/19 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 238/337 variables, 99/118 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 189/307 constraints. Problems are: Problem set: 48 solved, 189 unsolved
[2024-06-02 19:09:55] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 1/308 constraints. Problems are: Problem set: 48 solved, 189 unsolved
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 1/309 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/309 constraints. Problems are: Problem set: 48 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/309 constraints. Problems are: Problem set: 48 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 309 constraints, problems are : Problem set: 48 solved, 189 unsolved in 17312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 189/237 constraints, Known Traps: 11/11 constraints]
After SMT, in 32253ms problems are : Problem set: 48 solved, 189 unsolved
Search for dead transitions found 48 dead transitions in 32283ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 99/147 places, 190/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33346 ms. Remains : 99/147 places, 190/312 transitions.
Support contains 15 out of 99 places after structural reductions.
[2024-06-02 19:10:09] [INFO ] Flatten gal took : 64 ms
[2024-06-02 19:10:09] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:10:09] [INFO ] Input system was already deterministic with 190 transitions.
Support contains 13 out of 99 places (down from 15) after GAL structural reductions.
RANDOM walk for 40000 steps (1991 resets) in 1460 ms. (27 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (535 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (546 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (528 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
// Phase 1: matrix 190 rows 99 cols
[2024-06-02 19:10:10] [INFO ] Computed 10 invariants in 3 ms
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/79 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/247 variables, 79/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/270 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/286 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/289 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 109 constraints, problems are : Problem set: 0 solved, 3 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/79 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/247 variables, 79/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:10:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/270 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/274 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/286 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/289 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/289 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 113 constraints, problems are : Problem set: 0 solved, 3 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 4815 steps, including 141 resets, run visited all 2 properties in 39 ms. (steps per millisecond=123 )
Parikh walk visited 3 properties in 228 ms.
FORMULA MedleyA-PT-08-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 351 edges and 99 vertex of which 94 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 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 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 190/190 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 93 transition count 183
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 93 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 93 transition count 182
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 91 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 91 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 90 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 90 transition count 172
Applied a total of 19 rules in 14 ms. Remains 90 /99 variables (removed 9) and now considering 172/190 (removed 18) transitions.
// Phase 1: matrix 172 rows 90 cols
[2024-06-02 19:10:11] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:10:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 19:10:11] [INFO ] Invariant cache hit.
[2024-06-02 19:10:11] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 19:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 19:10:13] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-06-02 19:10:13] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:10:13] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 103 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6880 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 171/274 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 19:10:21] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 4 ms to minimize.
[2024-06-02 19:10:21] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:10:21] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:10:22] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 278 constraints, problems are : Problem set: 0 solved, 171 unsolved in 11871 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 7/7 constraints]
After SMT, in 18952ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 18955ms
Starting structural reductions in LTL mode, iteration 1 : 90/99 places, 172/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19197 ms. Remains : 90/99 places, 172/190 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-05
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-05 finished in 19516 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(G((p0&&F((G(F(p1))||(!p0&&F(p1))))))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 190/190 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 94 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 94 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 91 transition count 176
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 91 transition count 176
Applied a total of 16 rules in 8 ms. Remains 91 /99 variables (removed 8) and now considering 176/190 (removed 14) transitions.
// Phase 1: matrix 176 rows 91 cols
[2024-06-02 19:10:30] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:10:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 19:10:30] [INFO ] Invariant cache hit.
[2024-06-02 19:10:31] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-06-02 19:10:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-02 19:10:33] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:10:33] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:10:33] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/267 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 104 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7346 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/267 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 175/279 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 279 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8572 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 3/3 constraints]
After SMT, in 16097ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 16100ms
Starting structural reductions in LTL mode, iteration 1 : 91/99 places, 176/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16332 ms. Remains : 91/99 places, 176/190 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3762 steps with 185 reset in 30 ms.
FORMULA MedleyA-PT-08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-09 finished in 16616 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(((!p0 U p1)&&G(p2))))'
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 190/190 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 95 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 95 transition count 185
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 95 transition count 184
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 93 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 93 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 92 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 92 transition count 176
Applied a total of 15 rules in 18 ms. Remains 92 /99 variables (removed 7) and now considering 176/190 (removed 14) transitions.
// Phase 1: matrix 176 rows 92 cols
[2024-06-02 19:10:47] [INFO ] Computed 10 invariants in 11 ms
[2024-06-02 19:10:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:10:47] [INFO ] Invariant cache hit.
[2024-06-02 19:10:47] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-06-02 19:10:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-02 19:10:49] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:10:49] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:10:49] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/268 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 105 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7250 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/268 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 175/280 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-02 19:11:00] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:11:00] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:11:00] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/268 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-02 19:11:03] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-02 19:11:08] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:11:08] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/268 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 286 constraints, problems are : Problem set: 0 solved, 175 unsolved in 21283 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 28753ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 28757ms
Starting structural reductions in LTL mode, iteration 1 : 92/99 places, 176/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29053 ms. Remains : 92/99 places, 176/190 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1975 steps with 94 reset in 17 ms.
FORMULA MedleyA-PT-08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-11 finished in 29253 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(X(F(p0))))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 190/190 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 94 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 94 transition count 185
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 94 transition count 184
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 92 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 92 transition count 180
Applied a total of 15 rules in 14 ms. Remains 92 /99 variables (removed 7) and now considering 180/190 (removed 10) transitions.
// Phase 1: matrix 180 rows 92 cols
[2024-06-02 19:11:16] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:11:16] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-02 19:11:16] [INFO ] Invariant cache hit.
[2024-06-02 19:11:17] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-06-02 19:11:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-02 19:11:19] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:11:19] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:11:19] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/272 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 105 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7710 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/272 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 179/284 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 284 constraints, problems are : Problem set: 0 solved, 179 unsolved in 9337 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints]
After SMT, in 17242ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 17246ms
Starting structural reductions in LTL mode, iteration 1 : 92/99 places, 180/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17616 ms. Remains : 92/99 places, 180/190 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 215 ms.
Product exploration explored 100000 steps with 33333 reset in 199 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 332 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-08-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLCardinality-14 finished in 18205 ms.
All properties solved by simple procedures.
Total runtime 119730 ms.
ITS solved all properties within timeout
BK_STOP 1717355494964
--------------------
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="MedleyA-PT-08"
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 MedleyA-PT-08, 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 r575-smll-171734919500059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 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 '
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 ;