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.r488-tall-171631132500372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DiscoveryGPU-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132500372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 02:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 12 02:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717191889198

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:44:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:44:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:44:50] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-31 21:44:50] [INFO ] Transformed 184 places.
[2024-05-31 21:44:50] [INFO ] Transformed 194 transitions.
[2024-05-31 21:44:50] [INFO ] Found NUPN structural information;
[2024-05-31 21:44:50] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 39 place count 145 transition count 167
Iterating global reduction 1 with 27 rules applied. Total rules applied 66 place count 145 transition count 167
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 139 transition count 161
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 139 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 136 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 136 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 134 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 134 transition count 156
Applied a total of 88 rules in 61 ms. Remains 134 /184 variables (removed 50) and now considering 156/194 (removed 38) transitions.
// Phase 1: matrix 156 rows 134 cols
[2024-05-31 21:44:50] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 21:44:50] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-31 21:44:50] [INFO ] Invariant cache hit.
[2024-05-31 21:44:51] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-31 21:44:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/290 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 17 ms to minimize.
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:44:53] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 144 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 156/290 variables, 134/144 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 155/299 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 299 constraints, problems are : Problem set: 0 solved, 155 unsolved in 4722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 8/8 constraints]
After SMT, in 9972ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 9992ms
Starting structural reductions in LTL mode, iteration 1 : 134/184 places, 156/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10399 ms. Remains : 134/184 places, 156/194 transitions.
Support contains 34 out of 134 places after structural reductions.
[2024-05-31 21:45:01] [INFO ] Flatten gal took : 46 ms
[2024-05-31 21:45:01] [INFO ] Flatten gal took : 27 ms
[2024-05-31 21:45:01] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 33 out of 134 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (205 resets) in 1216 ms. (32 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (43 resets) in 81 ms. (487 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3672 steps (2 resets) in 6 ms. (524 steps per ms) remains 0/1 properties
Computed a total of 22 stabilizing places and 22 stable transitions
Graph (complete) has 261 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 112 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 106 transition count 123
Applied a total of 56 rules in 32 ms. Remains 106 /134 variables (removed 28) and now considering 123/156 (removed 33) transitions.
// Phase 1: matrix 123 rows 106 cols
[2024-05-31 21:45:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:45:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 21:45:02] [INFO ] Invariant cache hit.
[2024-05-31 21:45:02] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-31 21:45:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 21:45:03] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:45:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
[2024-05-31 21:45:03] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:45:03] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:45:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-31 21:45:04] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
[2024-05-31 21:45:04] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:45:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:45:04] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:45:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 118 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 122/240 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 240 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3056 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 6382ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 6384ms
Starting structural reductions in LTL mode, iteration 1 : 106/134 places, 123/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6575 ms. Remains : 106/134 places, 123/156 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 149 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-00 finished in 6966 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((p0||G(p1)))||X(F(p2))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 126 transition count 146
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 126 transition count 146
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 121 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 121 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 116 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 113 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 113 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 110 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 110 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 107 transition count 124
Applied a total of 54 rules in 13 ms. Remains 107 /134 variables (removed 27) and now considering 124/156 (removed 32) transitions.
// Phase 1: matrix 124 rows 107 cols
[2024-05-31 21:45:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:45:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 21:45:09] [INFO ] Invariant cache hit.
[2024-05-31 21:45:09] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-31 21:45:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/231 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:11] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 120 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/231 variables, 107/120 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 123/243 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 243 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 11/11 constraints]
After SMT, in 6396ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6398ms
Starting structural reductions in LTL mode, iteration 1 : 107/134 places, 124/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6528 ms. Remains : 107/134 places, 124/156 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 212 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 18 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-01 finished in 7070 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||X((G(p1) U (p0&&G(p1))))) U p1)))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 120 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 120 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 115 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 112 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 106 transition count 123
Applied a total of 56 rules in 22 ms. Remains 106 /134 variables (removed 28) and now considering 123/156 (removed 33) transitions.
// Phase 1: matrix 123 rows 106 cols
[2024-05-31 21:45:16] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:45:16] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 21:45:16] [INFO ] Invariant cache hit.
[2024-05-31 21:45:16] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-31 21:45:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 21:45:17] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:45:17] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:45:17] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:45:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:45:17] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:45:18] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
[2024-05-31 21:45:18] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:45:18] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:18] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:45:18] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 119 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 122/241 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 241 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 11/11 constraints]
After SMT, in 6124ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 6126ms
Starting structural reductions in LTL mode, iteration 1 : 106/134 places, 123/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6352 ms. Remains : 106/134 places, 123/156 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-03 finished in 6531 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((p0||X(p1)))&&X(F((p2||G(p3))))))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 115 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 115 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 113 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 113 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 111 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 108 transition count 126
Applied a total of 52 rules in 16 ms. Remains 108 /134 variables (removed 26) and now considering 126/156 (removed 30) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-31 21:45:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:45:23] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:45:23] [INFO ] Invariant cache hit.
[2024-05-31 21:45:23] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-31 21:45:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/234 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:45:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 122 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/234 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 125/247 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 247 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2971 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 12/12 constraints]
After SMT, in 6306ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6308ms
Starting structural reductions in LTL mode, iteration 1 : 108/134 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6495 ms. Remains : 108/134 places, 126/156 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 383 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-04 finished in 6690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Graph (complete) has 261 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 130 transition count 130
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 108 transition count 130
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 45 place count 108 transition count 112
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 81 place count 90 transition count 112
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 86 transition count 106
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 86 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 83 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 83 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 82 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 82 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 81 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 81 transition count 100
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 165 place count 48 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 44 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 44 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 40 transition count 55
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 40 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 36 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 36 transition count 47
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 32 transition count 43
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 32 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 28 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 28 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 24 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 22 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 227 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 231 place count 11 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 237 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 6 transition count 11
Applied a total of 241 rules in 47 ms. Remains 6 /134 variables (removed 128) and now considering 11/156 (removed 145) transitions.
[2024-05-31 21:45:29] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-31 21:45:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 21:45:29] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-31 21:45:29] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-31 21:45:29] [INFO ] Invariant cache hit.
[2024-05-31 21:45:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-31 21:45:29] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-31 21:45:29] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-31 21:45:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 149 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 210ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/134 places, 11/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 6/134 places, 11/156 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-05
Stuttering criterion allowed to conclude after 55 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-05 finished in 341 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(p0) U (p1||G(F(p2))||G(p3))))'
Support contains 6 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Graph (complete) has 261 edges and 134 vertex of which 132 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 131 transition count 134
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 112 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 110 transition count 132
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 43 place count 110 transition count 115
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 77 place count 93 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 89 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 89 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 86 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 86 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 84 transition count 102
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 84 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 82 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 82 transition count 100
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 153 place count 55 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 156 place count 52 transition count 67
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 52 transition count 67
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 49 transition count 64
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 49 transition count 64
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 46 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 46 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 43 transition count 55
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 43 transition count 55
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 41 transition count 51
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 41 transition count 51
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 39 transition count 49
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 39 transition count 49
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 3 with 2 rules applied. Total rules applied 187 place count 38 transition count 49
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 38 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 36 transition count 47
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 60 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 195 place count 34 transition count 43
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 199 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 place count 30 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 208 place count 26 transition count 38
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 6 with 2 rules applied. Total rules applied 210 place count 25 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 211 place count 24 transition count 36
Applied a total of 211 rules in 50 ms. Remains 24 /134 variables (removed 110) and now considering 36/156 (removed 120) transitions.
[2024-05-31 21:45:30] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 24 cols
[2024-05-31 21:45:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:45:30] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 21:45:30] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-31 21:45:30] [INFO ] Invariant cache hit.
[2024-05-31 21:45:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-31 21:45:30] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-31 21:45:30] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-31 21:45:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 30/51 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 3/54 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/55 variables, and 25 constraints, problems are : Problem set: 0 solved, 30 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 30/51 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 3/54 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/55 variables, and 55 constraints, problems are : Problem set: 0 solved, 30 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/134 places, 36/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 24/134 places, 36/156 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-07 finished in 941 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((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Graph (complete) has 261 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 130 transition count 133
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 111 transition count 133
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 39 place count 111 transition count 116
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 73 place count 94 transition count 116
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 88 transition count 108
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 88 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 84 transition count 104
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 84 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 81 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 81 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 78 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 78 transition count 95
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 161 place count 50 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 47 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 47 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 44 transition count 58
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 44 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 176 place count 41 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 179 place count 41 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 39 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 39 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 185 place count 37 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 37 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 189 place count 35 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 35 transition count 44
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 2 with 2 rules applied. Total rules applied 193 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 32 transition count 42
Applied a total of 195 rules in 24 ms. Remains 32 /134 variables (removed 102) and now considering 42/156 (removed 114) transitions.
[2024-05-31 21:45:30] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 32 cols
[2024-05-31 21:45:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:45:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 21:45:30] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-31 21:45:30] [INFO ] Invariant cache hit.
[2024-05-31 21:45:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:45:30] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-31 21:45:30] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-31 21:45:31] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-31 21:45:31] [INFO ] Invariant cache hit.
[2024-05-31 21:45:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 35 constraints, problems are : Problem set: 0 solved, 40 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 40/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 75 constraints, problems are : Problem set: 0 solved, 40 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 797ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 797ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/134 places, 42/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 899 ms. Remains : 32/134 places, 42/156 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 1219 reset in 236 ms.
Product exploration explored 100000 steps with 1197 reset in 171 ms.
Computed a total of 23 stabilizing places and 28 stable transitions
Computed a total of 23 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 110 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 17616 steps (184 resets) in 97 ms. (179 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F p1)]
Knowledge based reduction with 15 factoid took 366 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-31 21:45:33] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-31 21:45:33] [INFO ] Invariant cache hit.
[2024-05-31 21:45:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 21:45:33] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-31 21:45:33] [INFO ] Invariant cache hit.
[2024-05-31 21:45:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:45:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-31 21:45:33] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-31 21:45:33] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-31 21:45:33] [INFO ] Invariant cache hit.
[2024-05-31 21:45:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 35 constraints, problems are : Problem set: 0 solved, 40 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 40/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 75 constraints, problems are : Problem set: 0 solved, 40 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 833ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 833ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 899 ms. Remains : 32/32 places, 42/42 transitions.
Computed a total of 23 stabilizing places and 28 stable transitions
Computed a total of 23 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 110 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 8669 steps (94 resets) in 27 ms. (309 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F p1)]
Knowledge based reduction with 15 factoid took 340 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Product exploration explored 100000 steps with 1205 reset in 132 ms.
Stack based approach found an accepted trace after 63281 steps with 766 reset with depth 55 and stack size 50 in 170 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-08 finished in 4144 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&&X(G((p1&&(p2 U p3)))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 126 transition count 146
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 122 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 122 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 118 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 118 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 116 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 116 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 114 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 114 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 112 transition count 130
Applied a total of 44 rules in 10 ms. Remains 112 /134 variables (removed 22) and now considering 130/156 (removed 26) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-31 21:45:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:45:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:45:35] [INFO ] Invariant cache hit.
[2024-05-31 21:45:35] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-31 21:45:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/242 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:45:36] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 122 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 129/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 251 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 6429ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 6432ms
Starting structural reductions in LTL mode, iteration 1 : 112/134 places, 130/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6628 ms. Remains : 112/134 places, 130/156 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-10 finished in 6870 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(G(p0))))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 121 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 121 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 117 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 117 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 114 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 108 transition count 126
Applied a total of 52 rules in 15 ms. Remains 108 /134 variables (removed 26) and now considering 126/156 (removed 30) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-31 21:45:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:45:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 21:45:41] [INFO ] Invariant cache hit.
[2024-05-31 21:45:42] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-31 21:45:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/234 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-31 21:45:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 122 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/234 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 125/247 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 247 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 12/12 constraints]
After SMT, in 6114ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6115ms
Starting structural reductions in LTL mode, iteration 1 : 108/134 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6239 ms. Remains : 108/134 places, 126/156 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 142 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-11 finished in 6399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 114 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 108 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 105 transition count 122
Applied a total of 58 rules in 10 ms. Remains 105 /134 variables (removed 29) and now considering 122/156 (removed 34) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-31 21:45:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:45:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 21:45:48] [INFO ] Invariant cache hit.
[2024-05-31 21:45:48] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-31 21:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:45:49] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 115 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 236 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 5985ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 5986ms
Starting structural reductions in LTL mode, iteration 1 : 105/134 places, 122/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6116 ms. Remains : 105/134 places, 122/156 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-12
Stuttering criterion allowed to conclude after 271 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-12 finished in 6207 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(p0) U X(X(p1))))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 120 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 120 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 115 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 112 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 107 transition count 124
Applied a total of 54 rules in 13 ms. Remains 107 /134 variables (removed 27) and now considering 124/156 (removed 32) transitions.
// Phase 1: matrix 124 rows 107 cols
[2024-05-31 21:45:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:45:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 21:45:54] [INFO ] Invariant cache hit.
[2024-05-31 21:45:54] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-31 21:45:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/231 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-31 21:45:55] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:45:55] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:45:55] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:45:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:45:56] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:45:56] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:45:56] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 116 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2998 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/231 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 123/239 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 239 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2912 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 7/7 constraints]
After SMT, in 5935ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 5937ms
Starting structural reductions in LTL mode, iteration 1 : 107/134 places, 124/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6059 ms. Remains : 107/134 places, 124/156 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-13
Product exploration explored 100000 steps with 2482 reset in 182 ms.
Stack based approach found an accepted trace after 117 steps with 3 reset with depth 35 and stack size 35 in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-13 finished in 6612 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' '!(((p0 U p1) U X(X((!p2||F(G(p3)))))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 121 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 121 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 117 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 117 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 114 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 108 transition count 126
Applied a total of 52 rules in 9 ms. Remains 108 /134 variables (removed 26) and now considering 126/156 (removed 30) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-31 21:46:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:46:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 21:46:01] [INFO ] Invariant cache hit.
[2024-05-31 21:46:01] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-31 21:46:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/234 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:46:02] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 118 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/234 variables, 108/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 125/243 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 243 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3109 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 8/8 constraints]
After SMT, in 6244ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6246ms
Starting structural reductions in LTL mode, iteration 1 : 108/134 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6393 ms. Remains : 108/134 places, 126/156 transitions.
Stuttering acceptance computed with spot in 543 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Product exploration explored 100000 steps with 33333 reset in 73 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 216 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/108 stabilizing places and 20/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3)))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p1 p2 p3) (AND p0 p2 p3))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 21 ms. Reduced automaton from 11 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-14 finished in 7139 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(p0)||X((p1||X(F(p2))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 114 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 108 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 105 transition count 122
Applied a total of 58 rules in 6 ms. Remains 105 /134 variables (removed 29) and now considering 122/156 (removed 34) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-31 21:46:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:46:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 21:46:08] [INFO ] Invariant cache hit.
[2024-05-31 21:46:08] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-31 21:46:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-31 21:46:09] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 115 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 236 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 5927ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 5928ms
Starting structural reductions in LTL mode, iteration 1 : 105/134 places, 122/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6045 ms. Remains : 105/134 places, 122/156 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/105 stabilizing places and 20/122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-15 finished in 6350 ms.
All properties solved by simple procedures.
Total runtime 84257 ms.
ITS solved all properties within timeout

BK_STOP 1717191974662

--------------------
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="DiscoveryGPU-PT-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-06b, 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 r488-tall-171631132500372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;