About the Execution of GreatSPN+red for MedleyA-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 426.584 | 222925.00 | 270081.00 | 748.80 | FTFFFFFFFFFFFFTF | 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-171734919600092.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 43K 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-12-LTLFireability-00
FORMULA_NAME MedleyA-PT-12-LTLFireability-01
FORMULA_NAME MedleyA-PT-12-LTLFireability-02
FORMULA_NAME MedleyA-PT-12-LTLFireability-03
FORMULA_NAME MedleyA-PT-12-LTLFireability-04
FORMULA_NAME MedleyA-PT-12-LTLFireability-05
FORMULA_NAME MedleyA-PT-12-LTLFireability-06
FORMULA_NAME MedleyA-PT-12-LTLFireability-07
FORMULA_NAME MedleyA-PT-12-LTLFireability-08
FORMULA_NAME MedleyA-PT-12-LTLFireability-09
FORMULA_NAME MedleyA-PT-12-LTLFireability-10
FORMULA_NAME MedleyA-PT-12-LTLFireability-11
FORMULA_NAME MedleyA-PT-12-LTLFireability-12
FORMULA_NAME MedleyA-PT-12-LTLFireability-13
FORMULA_NAME MedleyA-PT-12-LTLFireability-14
FORMULA_NAME MedleyA-PT-12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717363843428
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:30:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:30:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:30:46] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-06-02 21:30:46] [INFO ] Transformed 172 places.
[2024-06-02 21:30:46] [INFO ] Transformed 166 transitions.
[2024-06-02 21:30:46] [INFO ] Found NUPN structural information;
[2024-06-02 21:30:46] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 478 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 166
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 156 transition count 154
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 156 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 155 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 155 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 154 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 154 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 153 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 153 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 152 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 152 transition count 150
Applied a total of 36 rules in 160 ms. Remains 152 /172 variables (removed 20) and now considering 150/166 (removed 16) transitions.
// Phase 1: matrix 150 rows 152 cols
[2024-06-02 21:30:47] [INFO ] Computed 20 invariants in 20 ms
[2024-06-02 21:30:47] [INFO ] Implicit Places using invariants in 586 ms returned [34, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 670 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/172 places, 150/166 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 888 ms. Remains : 150/172 places, 150/166 transitions.
Support contains 34 out of 150 places after structural reductions.
[2024-06-02 21:30:48] [INFO ] Flatten gal took : 104 ms
[2024-06-02 21:30:48] [INFO ] Flatten gal took : 38 ms
[2024-06-02 21:30:48] [INFO ] Input system was already deterministic with 150 transitions.
RANDOM walk for 40000 steps (828 resets) in 2103 ms. (19 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40004 steps (182 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (184 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
// Phase 1: matrix 150 rows 150 cols
[2024-06-02 21:30:49] [INFO ] Computed 18 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/150 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 150/300 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:30:50] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 35/150 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 150/300 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/300 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1373ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 2908 steps, including 129 resets, run visited all 2 properties in 88 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 100 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
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||X(F(p1))))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 145 transition count 146
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 145 transition count 146
Applied a total of 9 rules in 14 ms. Remains 145 /150 variables (removed 5) and now considering 146/150 (removed 4) transitions.
// Phase 1: matrix 146 rows 145 cols
[2024-06-02 21:30:51] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:30:51] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 21:30:51] [INFO ] Invariant cache hit.
[2024-06-02 21:30:51] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-06-02 21:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 21:30:54] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 6 ms to minimize.
[2024-06-02 21:30:54] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-02 21:30:55] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:30:55] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-02 21:30:55] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 3 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 65 places in 324 ms of which 2 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 170 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12899 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 21:31:06] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 146/291 variables, 145/171 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 145/316 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 21:31:09] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-06-02 21:31:10] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 7 ms to minimize.
[2024-06-02 21:31:10] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 21:31:16] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/291 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 21:31:22] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:31:23] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/291 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 322 constraints, problems are : Problem set: 0 solved, 145 unsolved in 27429 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 15/15 constraints]
After SMT, in 40435ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 40442ms
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 146/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40836 ms. Remains : 145/150 places, 146/150 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-02
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-02 finished in 41227 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((X((p0||X(F(p1))))&&F(p2))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 16 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-06-02 21:31:32] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:31:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 21:31:32] [INFO ] Invariant cache hit.
[2024-06-02 21:31:32] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 21:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 161 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7412 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/291 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:31:42] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:31:43] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:31:43] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 3 ms to minimize.
[2024-06-02 21:31:43] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:31:45] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:31:46] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:31:47] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 130 unsolved in 13475 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
After SMT, in 20944ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 20947ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21453 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-03 finished in 21694 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 U (G(!p0)||(!p0&&(p1 U (p2||G(p1)))))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 148 transition count 123
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 121 transition count 121
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 56 place count 121 transition count 97
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 105 place count 96 transition count 97
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 95 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 94 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 112 place count 90 transition count 92
Iterating global reduction 5 with 4 rules applied. Total rules applied 116 place count 90 transition count 92
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 164 place count 66 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 176 place count 60 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 60 transition count 78
Applied a total of 177 rules in 60 ms. Remains 60 /150 variables (removed 90) and now considering 78/150 (removed 72) transitions.
// Phase 1: matrix 78 rows 60 cols
[2024-06-02 21:31:54] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:31:54] [INFO ] Implicit Places using invariants in 135 ms returned [23, 31, 35, 38]
[2024-06-02 21:31:54] [INFO ] Actually due to overlaps returned [23, 35, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 139 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/150 places, 78/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 57 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 77
Applied a total of 4 rules in 22 ms. Remains 55 /57 variables (removed 2) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 55 cols
[2024-06-02 21:31:54] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 21:31:54] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 21:31:54] [INFO ] Invariant cache hit.
[2024-06-02 21:31:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:31:54] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/150 places, 77/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 538 ms. Remains : 55/150 places, 77/150 transitions.
Stuttering acceptance computed with spot in 229 ms :[p0, p0, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-04
Product exploration explored 100000 steps with 10410 reset in 861 ms.
Stack based approach found an accepted trace after 61271 steps with 6348 reset with depth 9 and stack size 9 in 242 ms.
FORMULA MedleyA-PT-12-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-12-LTLFireability-04 finished in 1915 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&&(p1||X(p2))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 142 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 4 ms. Remains 142 /150 variables (removed 8) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 21:31:56] [INFO ] Computed 17 invariants in 12 ms
[2024-06-02 21:31:56] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-06-02 21:31:56] [INFO ] Invariant cache hit.
[2024-06-02 21:31:56] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:31:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:31:58] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 3 ms to minimize.
[2024-06-02 21:31:58] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 167 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8066 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 131/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:32:07] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 5 ms to minimize.
[2024-06-02 21:32:07] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2024-06-02 21:32:08] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:32:08] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:32:10] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 304 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14998 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 14/14 constraints]
After SMT, in 23094ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 23097ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23753 ms. Remains : 142/150 places, 132/150 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-05 finished in 23898 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&&G(p1)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 143 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 143 transition count 133
Applied a total of 13 rules in 8 ms. Remains 143 /150 variables (removed 7) and now considering 133/150 (removed 17) transitions.
// Phase 1: matrix 133 rows 143 cols
[2024-06-02 21:32:19] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:32:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:32:20] [INFO ] Invariant cache hit.
[2024-06-02 21:32:20] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-02 21:32:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 21:32:22] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:32:22] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:32:22] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:32:22] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:32:22] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 21:32:23] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 3 ms to minimize.
[2024-06-02 21:32:23] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:32:23] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:32:24] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:32:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 133/276 variables, 143/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 170 constraints, problems are : Problem set: 0 solved, 132 unsolved in 8727 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/276 variables, 143/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 132/302 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 21:32:30] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 3 ms to minimize.
[2024-06-02 21:32:30] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 5 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 3 ms to minimize.
[2024-06-02 21:32:31] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 21:32:33] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 21:32:35] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 20 ms to minimize.
[2024-06-02 21:32:35] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 3 ms to minimize.
[2024-06-02 21:32:35] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (OVERLAPS) 0/276 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 311 constraints, problems are : Problem set: 0 solved, 132 unsolved in 14015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 19/19 constraints]
After SMT, in 22763ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 22765ms
Starting structural reductions in LTL mode, iteration 1 : 143/150 places, 133/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23020 ms. Remains : 143/150 places, 133/150 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-06 finished in 23191 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)||G(p1))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 142 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 7 ms. Remains 142 /150 variables (removed 8) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 21:32:43] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:32:43] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 21:32:43] [INFO ] Invariant cache hit.
[2024-06-02 21:32:43] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:32:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:32:45] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:32:45] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:32:45] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-06-02 21:32:45] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:32:46] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:32:46] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:32:46] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 166 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6751 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 131/297 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:32:53] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:32:53] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-06-02 21:32:53] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:32:55] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:32:57] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 302 constraints, problems are : Problem set: 0 solved, 131 unsolved in 12854 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
After SMT, in 19625ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 19627ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19944 ms. Remains : 142/150 places, 132/150 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-07
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-07 finished in 20115 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&&F((G(F(p1))||(!p2&&F(p1)))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 146 transition count 147
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 146 transition count 147
Applied a total of 7 rules in 5 ms. Remains 146 /150 variables (removed 4) and now considering 147/150 (removed 3) transitions.
// Phase 1: matrix 147 rows 146 cols
[2024-06-02 21:33:03] [INFO ] Computed 17 invariants in 11 ms
[2024-06-02 21:33:03] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 21:33:03] [INFO ] Invariant cache hit.
[2024-06-02 21:33:03] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-06-02 21:33:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 21:33:05] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:33:05] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:33:05] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:33:06] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:33:06] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:33:06] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 21:33:06] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:33:07] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 147/293 variables, 146/171 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 21:33:10] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/293 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 172 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10720 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/293 variables, 146/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 146/318 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 21:33:16] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-06-02 21:33:16] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:33:16] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:33:17] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:33:17] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 323 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11169 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 14/14 constraints]
After SMT, in 21926ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 21930ms
Starting structural reductions in LTL mode, iteration 1 : 146/150 places, 147/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22247 ms. Remains : 146/150 places, 147/150 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-09
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-09 finished in 22447 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&&X(X(F(p1)))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 142 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 142 transition count 131
Applied a total of 16 rules in 3 ms. Remains 142 /150 variables (removed 8) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 142 cols
[2024-06-02 21:33:25] [INFO ] Computed 18 invariants in 3 ms
[2024-06-02 21:33:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:33:25] [INFO ] Invariant cache hit.
[2024-06-02 21:33:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 21:33:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:33:28] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:33:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:33:28] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 163 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6983 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 130/293 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:33:35] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-06-02 21:33:35] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 3 ms to minimize.
[2024-06-02 21:33:35] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:33:35] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 3 ms to minimize.
[2024-06-02 21:33:36] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 3 ms to minimize.
[2024-06-02 21:33:36] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:33:37] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 3 ms to minimize.
[2024-06-02 21:33:37] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:33:37] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:33:39] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 303 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12346 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 13/13 constraints]
After SMT, in 19347ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 19350ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19606 ms. Remains : 142/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-10 finished in 19792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 148 transition count 124
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 123 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 122 transition count 122
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 54 place count 122 transition count 95
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 109 place count 94 transition count 95
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 93 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 92 transition count 94
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 120 place count 84 transition count 75
Iterating global reduction 5 with 8 rules applied. Total rules applied 128 place count 84 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 128 place count 84 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 83 transition count 74
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 182 place count 57 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 196 place count 50 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 50 transition count 68
Applied a total of 197 rules in 40 ms. Remains 50 /150 variables (removed 100) and now considering 68/150 (removed 82) transitions.
// Phase 1: matrix 68 rows 50 cols
[2024-06-02 21:33:45] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:33:45] [INFO ] Implicit Places using invariants in 77 ms returned [15, 22, 26, 29]
[2024-06-02 21:33:45] [INFO ] Actually due to overlaps returned [15, 26, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/150 places, 68/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 47 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 67
Applied a total of 4 rules in 9 ms. Remains 45 /47 variables (removed 2) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 45 cols
[2024-06-02 21:33:45] [INFO ] Computed 12 invariants in 0 ms
[2024-06-02 21:33:45] [INFO ] Implicit Places using invariants in 66 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/150 places, 67/150 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 77
Applied a total of 2 rules in 9 ms. Remains 43 /44 variables (removed 1) and now considering 77/67 (removed -10) transitions.
// Phase 1: matrix 77 rows 43 cols
[2024-06-02 21:33:45] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 21:33:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 21:33:45] [INFO ] Invariant cache hit.
[2024-06-02 21:33:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:33:45] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/150 places, 77/150 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 401 ms. Remains : 43/150 places, 77/150 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-11 finished in 458 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((X(X(G(p0))) U p0))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 5 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-06-02 21:33:45] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 21:33:46] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 21:33:46] [INFO ] Invariant cache hit.
[2024-06-02 21:33:46] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 21:33:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:33:48] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:33:48] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:33:48] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 161 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6425 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/291 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:33:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-06-02 21:33:55] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:33:55] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2024-06-02 21:33:56] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:33:57] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:33:59] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:34:00] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 130 unsolved in 13033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
After SMT, in 19480ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 19484ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19860 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-12 finished in 20072 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(X(F(p0)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 5 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
[2024-06-02 21:34:05] [INFO ] Invariant cache hit.
[2024-06-02 21:34:06] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 21:34:06] [INFO ] Invariant cache hit.
[2024-06-02 21:34:06] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 21:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:34:08] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-06-02 21:34:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:34:08] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 161 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6572 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/291 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:34:15] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:34:15] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:34:15] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:34:15] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 3 ms to minimize.
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:34:18] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12325 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
After SMT, in 18921ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 18924ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19322 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-13
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-13 finished in 19600 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||F(p1)))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 148 transition count 123
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 121 transition count 121
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 56 place count 121 transition count 96
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 107 place count 95 transition count 96
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 94 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 93 transition count 95
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 114 place count 89 transition count 91
Iterating global reduction 5 with 4 rules applied. Total rules applied 118 place count 89 transition count 91
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 168 place count 64 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 180 place count 58 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 58 transition count 76
Applied a total of 181 rules in 50 ms. Remains 58 /150 variables (removed 92) and now considering 76/150 (removed 74) transitions.
// Phase 1: matrix 76 rows 58 cols
[2024-06-02 21:34:25] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:34:25] [INFO ] Implicit Places using invariants in 131 ms returned [21, 29, 33, 36]
[2024-06-02 21:34:25] [INFO ] Actually due to overlaps returned [21, 33, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 134 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/150 places, 76/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 55 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 75
Applied a total of 4 rules in 19 ms. Remains 53 /55 variables (removed 2) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 53 cols
[2024-06-02 21:34:25] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 21:34:25] [INFO ] Implicit Places using invariants in 85 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/150 places, 75/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 73
Applied a total of 4 rules in 10 ms. Remains 50 /52 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 50 cols
[2024-06-02 21:34:25] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 21:34:25] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:34:26] [INFO ] Invariant cache hit.
[2024-06-02 21:34:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:34:26] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 50/150 places, 73/150 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 570 ms. Remains : 50/150 places, 73/150 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-15 finished in 697 ms.
All properties solved by simple procedures.
Total runtime 220416 ms.
ITS solved all properties within timeout
BK_STOP 1717364066353
--------------------
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 LTLFireability -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-12"
export BK_EXAMINATION="LTLFireability"
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-12, examination is LTLFireability"
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-171734919600092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-12.tgz
mv MedleyA-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;