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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 01:30 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 82K 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-11b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716367156993

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:39:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 08:39:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:39:18] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-22 08:39:18] [INFO ] Transformed 324 places.
[2024-05-22 08:39:18] [INFO ] Transformed 344 transitions.
[2024-05-22 08:39:18] [INFO ] Found NUPN structural information;
[2024-05-22 08:39:18] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 181 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 2 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 74 place count 250 transition count 292
Iterating global reduction 1 with 52 rules applied. Total rules applied 126 place count 250 transition count 292
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 242 transition count 284
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 242 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 236 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 236 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 158 place count 232 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 162 place count 232 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 165 place count 229 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 168 place count 229 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 170 place count 227 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 172 place count 227 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 225 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 225 transition count 264
Applied a total of 176 rules in 98 ms. Remains 225 /324 variables (removed 99) and now considering 264/344 (removed 80) transitions.
// Phase 1: matrix 264 rows 225 cols
[2024-05-22 08:39:18] [INFO ] Computed 2 invariants in 22 ms
[2024-05-22 08:39:18] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-22 08:39:18] [INFO ] Invariant cache hit.
[2024-05-22 08:39:19] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-22 08:39:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/489 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 20 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 3 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-22 08:39:24] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:39:25] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/489 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 250 constraints, problems are : Problem set: 0 solved, 263 unsolved in 15074 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 264/489 variables, 225/250 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 263/513 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 08:39:38] [INFO ] Deduced a trap composed of 151 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 514 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 24/24 constraints]
After SMT, in 35816ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 35837ms
Starting structural reductions in LTL mode, iteration 1 : 225/324 places, 264/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36401 ms. Remains : 225/324 places, 264/344 transitions.
Support contains 34 out of 225 places after structural reductions.
[2024-05-22 08:39:55] [INFO ] Flatten gal took : 44 ms
[2024-05-22 08:39:55] [INFO ] Flatten gal took : 18 ms
[2024-05-22 08:39:55] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 31 out of 225 places (down from 34) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (110 resets) in 1194 ms. (33 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40004 steps (21 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
[2024-05-22 08:39:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/113 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 323/436 variables, 164/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 50/486 variables, 45/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/489 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:39:55] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 489/489 variables, and 228 constraints, problems are : Problem set: 1 solved, 0 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 175ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 448 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 212 transition count 250
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 212 transition count 250
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 205 transition count 243
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 205 transition count 243
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 199 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 199 transition count 236
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 194 transition count 228
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 194 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 189 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 189 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 185 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 185 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 184 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 184 transition count 217
Applied a total of 82 rules in 28 ms. Remains 184 /225 variables (removed 41) and now considering 217/264 (removed 47) transitions.
// Phase 1: matrix 217 rows 184 cols
[2024-05-22 08:39:56] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 08:39:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 08:39:56] [INFO ] Invariant cache hit.
[2024-05-22 08:39:56] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-22 08:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/401 variables, 184/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 08:39:59] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 08:39:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:39:59] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:39:59] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:39:59] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:40:00] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 19/205 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 205 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8886 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/401 variables, 184/205 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 216/421 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 421 constraints, problems are : Problem set: 0 solved, 216 unsolved in 9699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 19/19 constraints]
After SMT, in 18666ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 18672ms
Starting structural reductions in LTL mode, iteration 1 : 184/225 places, 217/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18891 ms. Remains : 184/225 places, 217/264 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1117 steps with 2 reset in 14 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-00 finished in 19208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 212 transition count 250
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 212 transition count 250
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 204 transition count 242
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 204 transition count 242
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 197 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 197 transition count 233
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 191 transition count 224
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 191 transition count 224
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 185 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 185 transition count 217
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 181 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 180 transition count 212
Applied a total of 90 rules in 25 ms. Remains 180 /225 variables (removed 45) and now considering 212/264 (removed 52) transitions.
// Phase 1: matrix 212 rows 180 cols
[2024-05-22 08:40:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 08:40:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-22 08:40:15] [INFO ] Invariant cache hit.
[2024-05-22 08:40:15] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-22 08:40:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:40:18] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:40:19] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:40:20] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:40:20] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-22 08:40:20] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 204 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/415 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 415 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 22/22 constraints]
After SMT, in 18487ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 18490ms
Starting structural reductions in LTL mode, iteration 1 : 180/225 places, 212/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18752 ms. Remains : 180/225 places, 212/264 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-01
Product exploration explored 100000 steps with 7161 reset in 175 ms.
Stack based approach found an accepted trace after 155 steps with 9 reset with depth 24 and stack size 24 in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-01 finished in 19073 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(p0) U p1)))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 214 transition count 252
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 214 transition count 252
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 208 transition count 246
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 208 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 203 transition count 241
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 203 transition count 241
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 199 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 199 transition count 234
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 195 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 195 transition count 229
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 191 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 191 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 190 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 190 transition count 224
Applied a total of 70 rules in 25 ms. Remains 190 /225 variables (removed 35) and now considering 224/264 (removed 40) transitions.
// Phase 1: matrix 224 rows 190 cols
[2024-05-22 08:40:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 08:40:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 08:40:34] [INFO ] Invariant cache hit.
[2024-05-22 08:40:34] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-22 08:40:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 224/414 variables, 190/192 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-22 08:40:38] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:40:39] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 15/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/414 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 207 constraints, problems are : Problem set: 0 solved, 223 unsolved in 9076 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/414 variables, 190/207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 223/430 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 0/414 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 430 constraints, problems are : Problem set: 0 solved, 223 unsolved in 9469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 15/15 constraints]
After SMT, in 18613ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 18617ms
Starting structural reductions in LTL mode, iteration 1 : 190/225 places, 224/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18820 ms. Remains : 190/225 places, 224/264 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-02 finished in 18962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 213 transition count 251
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 213 transition count 251
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 206 transition count 244
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 206 transition count 244
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 199 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 199 transition count 235
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 193 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 193 transition count 226
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 187 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 187 transition count 219
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 183 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 183 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 182 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 182 transition count 214
Applied a total of 86 rules in 18 ms. Remains 182 /225 variables (removed 43) and now considering 214/264 (removed 50) transitions.
// Phase 1: matrix 214 rows 182 cols
[2024-05-22 08:40:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 08:40:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 08:40:53] [INFO ] Invariant cache hit.
[2024-05-22 08:40:53] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-22 08:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 214/396 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 08:40:56] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-22 08:40:56] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:40:56] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:40:56] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:40:57] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 196 constraints, problems are : Problem set: 0 solved, 213 unsolved in 8416 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/396 variables, 182/196 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 213/409 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 409 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints]
After SMT, in 17792ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 17795ms
Starting structural reductions in LTL mode, iteration 1 : 182/225 places, 214/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17992 ms. Remains : 182/225 places, 214/264 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-03 finished in 18113 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)&&F(G(p2))))'
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Graph (complete) has 448 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 222 transition count 228
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 189 transition count 228
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 67 place count 189 transition count 191
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 141 place count 152 transition count 191
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 149 place count 144 transition count 182
Iterating global reduction 2 with 8 rules applied. Total rules applied 157 place count 144 transition count 182
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 162 place count 139 transition count 177
Iterating global reduction 2 with 5 rules applied. Total rules applied 167 place count 139 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 135 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 135 transition count 169
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 131 transition count 165
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 131 transition count 165
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 283 place count 81 transition count 115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 292 place count 72 transition count 98
Iterating global reduction 2 with 9 rules applied. Total rules applied 301 place count 72 transition count 98
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 310 place count 63 transition count 88
Iterating global reduction 2 with 9 rules applied. Total rules applied 319 place count 63 transition count 88
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 328 place count 54 transition count 70
Iterating global reduction 2 with 9 rules applied. Total rules applied 337 place count 54 transition count 70
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 346 place count 45 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 355 place count 45 transition count 61
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 364 place count 36 transition count 43
Iterating global reduction 2 with 9 rules applied. Total rules applied 373 place count 36 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 382 place count 27 transition count 34
Iterating global reduction 2 with 9 rules applied. Total rules applied 391 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 26 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 25 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 397 place count 25 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 23 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 402 place count 22 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 404 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 404 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 412 place count 16 transition count 21
Applied a total of 412 rules in 76 ms. Remains 16 /225 variables (removed 209) and now considering 21/264 (removed 243) transitions.
[2024-05-22 08:41:11] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2024-05-22 08:41:11] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:41:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 08:41:11] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-22 08:41:11] [INFO ] Invariant cache hit.
[2024-05-22 08:41:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:41:11] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-22 08:41:11] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 08:41:11] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-22 08:41:11] [INFO ] Invariant cache hit.
[2024-05-22 08:41:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 18 constraints, problems are : Problem set: 0 solved, 20 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 38 constraints, problems are : Problem set: 0 solved, 20 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 370ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/225 places, 21/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 16/225 places, 21/264 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-04
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-04 finished in 688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 213 transition count 251
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 213 transition count 251
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 205 transition count 243
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 205 transition count 243
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 199 transition count 235
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 199 transition count 235
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 194 transition count 228
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 194 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 189 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 189 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 186 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 186 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 185 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 185 transition count 218
Applied a total of 80 rules in 27 ms. Remains 185 /225 variables (removed 40) and now considering 218/264 (removed 46) transitions.
// Phase 1: matrix 218 rows 185 cols
[2024-05-22 08:41:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 08:41:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 08:41:12] [INFO ] Invariant cache hit.
[2024-05-22 08:41:12] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-22 08:41:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/403 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 08:41:15] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-22 08:41:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:41:15] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:41:15] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-05-22 08:41:15] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:41:16] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 207 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7839 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/403 variables, 185/207 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 217/424 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 424 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 20/20 constraints]
After SMT, in 17236ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 17238ms
Starting structural reductions in LTL mode, iteration 1 : 185/225 places, 218/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17467 ms. Remains : 185/225 places, 218/264 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 141 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-05 finished in 17600 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))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Graph (complete) has 448 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 222 transition count 228
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 189 transition count 228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 67 place count 189 transition count 192
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 139 place count 153 transition count 192
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 149 place count 143 transition count 181
Iterating global reduction 2 with 10 rules applied. Total rules applied 159 place count 143 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 159 place count 143 transition count 180
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 142 transition count 180
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 136 transition count 174
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 136 transition count 174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 131 transition count 164
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 131 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 126 transition count 159
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 126 transition count 159
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 291 place count 77 transition count 110
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 301 place count 67 transition count 91
Iterating global reduction 2 with 10 rules applied. Total rules applied 311 place count 67 transition count 91
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 321 place count 57 transition count 80
Iterating global reduction 2 with 10 rules applied. Total rules applied 331 place count 57 transition count 80
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 341 place count 47 transition count 60
Iterating global reduction 2 with 10 rules applied. Total rules applied 351 place count 47 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 360 place count 38 transition count 51
Iterating global reduction 2 with 9 rules applied. Total rules applied 369 place count 38 transition count 51
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 378 place count 29 transition count 33
Iterating global reduction 2 with 9 rules applied. Total rules applied 387 place count 29 transition count 33
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 396 place count 20 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 405 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 408 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 411 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 15 vertex of which 14 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 414 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 13 transition count 17
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 4 with 2 rules applied. Total rules applied 417 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 419 place count 10 transition count 15
Applied a total of 419 rules in 39 ms. Remains 10 /225 variables (removed 215) and now considering 15/264 (removed 249) transitions.
[2024-05-22 08:41:29] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2024-05-22 08:41:29] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 08:41:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 08:41:29] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-22 08:41:29] [INFO ] Invariant cache hit.
[2024-05-22 08:41:29] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-22 08:41:29] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 08:41:29] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-22 08:41:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/22 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/225 places, 15/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 10/225 places, 15/264 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-06 finished in 268 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))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 214 transition count 253
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 214 transition count 253
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 207 transition count 246
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 207 transition count 246
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 201 transition count 238
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 201 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 195 transition count 229
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 195 transition count 229
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 189 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 189 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 185 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 185 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 184 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 184 transition count 217
Applied a total of 82 rules in 31 ms. Remains 184 /225 variables (removed 41) and now considering 217/264 (removed 47) transitions.
// Phase 1: matrix 217 rows 184 cols
[2024-05-22 08:41:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 08:41:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 08:41:30] [INFO ] Invariant cache hit.
[2024-05-22 08:41:30] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-22 08:41:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/401 variables, 184/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:41:33] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 08:41:34] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 08:41:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:41:34] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 12/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 198 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8416 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/401 variables, 184/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 216/414 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 414 constraints, problems are : Problem set: 0 solved, 216 unsolved in 10127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 12/12 constraints]
After SMT, in 18606ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 18608ms
Starting structural reductions in LTL mode, iteration 1 : 184/225 places, 217/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18797 ms. Remains : 184/225 places, 217/264 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-07 finished in 18916 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((p0&&X(X(G(p0)))))))'
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 212 transition count 250
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 212 transition count 250
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 204 transition count 242
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 204 transition count 242
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 197 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 197 transition count 233
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 191 transition count 224
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 191 transition count 224
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 185 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 185 transition count 217
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 181 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 180 transition count 212
Applied a total of 90 rules in 16 ms. Remains 180 /225 variables (removed 45) and now considering 212/264 (removed 52) transitions.
// Phase 1: matrix 212 rows 180 cols
[2024-05-22 08:41:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 08:41:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 08:41:49] [INFO ] Invariant cache hit.
[2024-05-22 08:41:49] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-22 08:41:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:41:52] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 3 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-22 08:41:53] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 204 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/204 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/415 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 415 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 22/22 constraints]
After SMT, in 18820ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 18822ms
Starting structural reductions in LTL mode, iteration 1 : 180/225 places, 212/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19017 ms. Remains : 180/225 places, 212/264 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-08 finished in 19262 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))'
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Graph (complete) has 448 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 222 transition count 227
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 188 transition count 227
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 69 place count 188 transition count 191
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 141 place count 152 transition count 191
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 151 place count 142 transition count 180
Iterating global reduction 2 with 10 rules applied. Total rules applied 161 place count 142 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 142 transition count 179
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 163 place count 141 transition count 179
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 135 transition count 173
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 135 transition count 173
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 130 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 130 transition count 163
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 125 transition count 158
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 125 transition count 158
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 291 place count 77 transition count 110
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 301 place count 67 transition count 91
Iterating global reduction 2 with 10 rules applied. Total rules applied 311 place count 67 transition count 91
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 321 place count 57 transition count 80
Iterating global reduction 2 with 10 rules applied. Total rules applied 331 place count 57 transition count 80
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 341 place count 47 transition count 60
Iterating global reduction 2 with 10 rules applied. Total rules applied 351 place count 47 transition count 60
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 361 place count 37 transition count 50
Iterating global reduction 2 with 10 rules applied. Total rules applied 371 place count 37 transition count 50
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 381 place count 27 transition count 30
Iterating global reduction 2 with 10 rules applied. Total rules applied 391 place count 27 transition count 30
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 401 place count 17 transition count 20
Iterating global reduction 2 with 10 rules applied. Total rules applied 411 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 412 place count 16 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 413 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 414 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 15 transition count 17
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 416 place count 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 13 edges and 11 vertex of which 8 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 423 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 425 place count 6 transition count 9
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 4 with 2 rules applied. Total rules applied 427 place count 5 transition count 8
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 4 with 2 rules applied. Total rules applied 429 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 430 place count 4 transition count 6
Applied a total of 430 rules in 42 ms. Remains 4 /225 variables (removed 221) and now considering 6/264 (removed 258) transitions.
[2024-05-22 08:42:08] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 08:42:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 08:42:08] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 08:42:08] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 08:42:08] [INFO ] Invariant cache hit.
[2024-05-22 08:42:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-22 08:42:08] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 08:42:08] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 08:42:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/225 places, 6/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 4/225 places, 6/264 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-09 finished in 196 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((F(p1)&&p0))||(F(p3)&&p2))))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Graph (complete) has 448 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 222 transition count 230
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 191 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 190 transition count 229
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 65 place count 190 transition count 192
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 139 place count 153 transition count 192
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 149 place count 143 transition count 181
Iterating global reduction 3 with 10 rules applied. Total rules applied 159 place count 143 transition count 181
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 165 place count 137 transition count 175
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 137 transition count 175
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 132 transition count 165
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 132 transition count 165
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 186 place count 127 transition count 160
Iterating global reduction 3 with 5 rules applied. Total rules applied 191 place count 127 transition count 160
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 285 place count 80 transition count 113
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 295 place count 70 transition count 94
Iterating global reduction 3 with 10 rules applied. Total rules applied 305 place count 70 transition count 94
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 315 place count 60 transition count 83
Iterating global reduction 3 with 10 rules applied. Total rules applied 325 place count 60 transition count 83
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 334 place count 51 transition count 65
Iterating global reduction 3 with 9 rules applied. Total rules applied 343 place count 51 transition count 65
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 352 place count 42 transition count 56
Iterating global reduction 3 with 9 rules applied. Total rules applied 361 place count 42 transition count 56
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 368 place count 35 transition count 42
Iterating global reduction 3 with 7 rules applied. Total rules applied 375 place count 35 transition count 42
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 382 place count 28 transition count 35
Iterating global reduction 3 with 7 rules applied. Total rules applied 389 place count 28 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 28 transition count 34
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 391 place count 28 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 393 place count 26 transition count 32
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 395 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 396 place count 24 transition count 31
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 396 place count 24 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 402 place count 21 transition count 28
Applied a total of 402 rules in 30 ms. Remains 21 /225 variables (removed 204) and now considering 28/264 (removed 236) transitions.
[2024-05-22 08:42:08] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 21 cols
[2024-05-22 08:42:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 08:42:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 08:42:08] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2024-05-22 08:42:08] [INFO ] Invariant cache hit.
[2024-05-22 08:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:42:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-22 08:42:08] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-22 08:42:08] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2024-05-22 08:42:08] [INFO ] Invariant cache hit.
[2024-05-22 08:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 25/46 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 23 constraints, problems are : Problem set: 0 solved, 27 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 25/46 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 50 constraints, problems are : Problem set: 0 solved, 27 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 468ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/225 places, 28/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 560 ms. Remains : 21/225 places, 28/264 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-11
Stuttering criterion allowed to conclude after 149 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-11 finished in 782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 213 transition count 251
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 213 transition count 251
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 206 transition count 244
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 206 transition count 244
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 200 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 200 transition count 236
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 195 transition count 229
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 195 transition count 229
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 190 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 190 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 187 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 187 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 186 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 186 transition count 219
Applied a total of 78 rules in 12 ms. Remains 186 /225 variables (removed 39) and now considering 219/264 (removed 45) transitions.
// Phase 1: matrix 219 rows 186 cols
[2024-05-22 08:42:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 08:42:09] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 08:42:09] [INFO ] Invariant cache hit.
[2024-05-22 08:42:09] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-22 08:42:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/405 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 08:42:12] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-22 08:42:12] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-22 08:42:12] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-22 08:42:12] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:42:13] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 19/207 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 207 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9344 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/405 variables, 186/207 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 218/425 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 425 constraints, problems are : Problem set: 0 solved, 218 unsolved in 10128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 19/19 constraints]
After SMT, in 19531ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 19536ms
Starting structural reductions in LTL mode, iteration 1 : 186/225 places, 219/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19748 ms. Remains : 186/225 places, 219/264 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-12
Stuttering criterion allowed to conclude after 461 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-12 finished in 20026 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 G(p1))&&X(G(p2)))))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 264/264 transitions.
Graph (complete) has 448 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 223 transition count 230
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 191 transition count 230
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 65 place count 191 transition count 193
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 139 place count 154 transition count 193
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 147 place count 146 transition count 184
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 146 transition count 184
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 142 transition count 180
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 142 transition count 180
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 139 transition count 174
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 139 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 172 place count 136 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 136 transition count 171
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 275 place count 86 transition count 121
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 283 place count 78 transition count 106
Iterating global reduction 2 with 8 rules applied. Total rules applied 291 place count 78 transition count 106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 299 place count 70 transition count 97
Iterating global reduction 2 with 8 rules applied. Total rules applied 307 place count 70 transition count 97
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 315 place count 62 transition count 81
Iterating global reduction 2 with 8 rules applied. Total rules applied 323 place count 62 transition count 81
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 331 place count 54 transition count 73
Iterating global reduction 2 with 8 rules applied. Total rules applied 339 place count 54 transition count 73
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 347 place count 46 transition count 57
Iterating global reduction 2 with 8 rules applied. Total rules applied 355 place count 46 transition count 57
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 363 place count 38 transition count 49
Iterating global reduction 2 with 8 rules applied. Total rules applied 371 place count 38 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 372 place count 37 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 373 place count 37 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 374 place count 36 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 375 place count 36 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 378 place count 36 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 36 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 34 transition count 41
Reduce places removed 1 places and 0 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 2 with 4 rules applied. Total rules applied 385 place count 33 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 388 place count 30 transition count 38
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 388 place count 30 transition count 32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 400 place count 24 transition count 32
Applied a total of 400 rules in 24 ms. Remains 24 /225 variables (removed 201) and now considering 32/264 (removed 232) transitions.
[2024-05-22 08:42:29] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2024-05-22 08:42:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:42:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 08:42:29] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 08:42:29] [INFO ] Invariant cache hit.
[2024-05-22 08:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:42:29] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-22 08:42:29] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-22 08:42:29] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 08:42:29] [INFO ] Invariant cache hit.
[2024-05-22 08:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 26 constraints, problems are : Problem set: 0 solved, 31 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 31 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/225 places, 32/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 658 ms. Remains : 24/225 places, 32/264 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-15
Stuttering criterion allowed to conclude after 383 steps with 2 reset in 5 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-15 finished in 934 ms.
All properties solved by simple procedures.
Total runtime 192005 ms.
ITS solved all properties within timeout

BK_STOP 1716367350276

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b 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 ;