About the Execution of ITS-Tools for DiscoveryGPU-PT-14a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 99787.00 | 0.00 | 0.00 | FFTFFFFFFTFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700740.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DiscoveryGPU-PT-14a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700740
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 50K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748950023121
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 11:27:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 11:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 11:27:05] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-03 11:27:05] [INFO ] Transformed 143 places.
[2025-06-03 11:27:05] [INFO ] Transformed 197 transitions.
[2025-06-03 11:27:05] [INFO ] Found NUPN structural information;
[2025-06-03 11:27:05] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 133 transition count 187
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 133 transition count 187
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 125 transition count 179
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 125 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 121 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 121 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 121 transition count 161
Applied a total of 54 rules in 75 ms. Remains 121 /143 variables (removed 22) and now considering 161/197 (removed 36) transitions.
// Phase 1: matrix 161 rows 121 cols
[2025-06-03 11:27:05] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:06] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-03 11:27:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:06] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-03 11:27:06] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-03 11:27:06] [INFO ] Invariant cache hit.
[2025-06-03 11:27:06] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 161/282 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 104/227 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 227 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 161/282 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 104/227 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 160/387 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 387 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17137ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 17159ms
Starting structural reductions in LTL mode, iteration 1 : 121/143 places, 161/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18011 ms. Remains : 121/143 places, 161/197 transitions.
Support contains 33 out of 121 places after structural reductions.
[2025-06-03 11:27:23] [INFO ] Flatten gal took : 49 ms
[2025-06-03 11:27:23] [INFO ] Flatten gal took : 22 ms
[2025-06-03 11:27:23] [INFO ] Input system was already deterministic with 161 transitions.
RANDOM walk for 23969 steps (153 resets) in 641 ms. (37 steps per ms) remains 0/34 properties
FORMULA DiscoveryGPU-PT-14a-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 15 stable transitions
Graph (complete) has 362 edges and 121 vertex of which 117 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 112 transition count 152
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 112 transition count 152
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 107 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 107 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 104 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 104 transition count 144
Applied a total of 34 rules in 22 ms. Remains 104 /121 variables (removed 17) and now considering 144/161 (removed 17) transitions.
// Phase 1: matrix 144 rows 104 cols
[2025-06-03 11:27:24] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:24] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-03 11:27:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:25] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:27:25] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2025-06-03 11:27:25] [INFO ] Invariant cache hit.
[2025-06-03 11:27:25] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/248 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 99/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 205 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6152 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/248 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 99/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 143/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 348 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13393ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 13396ms
Starting structural reductions in LTL mode, iteration 1 : 104/121 places, 144/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13854 ms. Remains : 104/121 places, 144/161 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-00
Product exploration explored 100000 steps with 2976 reset in 626 ms.
Stack based approach found an accepted trace after 34 steps with 1 reset with depth 15 and stack size 15 in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-00 finished in 14950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Graph (complete) has 362 edges and 121 vertex of which 117 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 117 transition count 151
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 111 transition count 151
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 22 place count 102 transition count 142
Iterating global reduction 0 with 9 rules applied. Total rules applied 31 place count 102 transition count 142
Applied a total of 31 rules in 36 ms. Remains 102 /121 variables (removed 19) and now considering 142/161 (removed 19) transitions.
// Phase 1: matrix 142 rows 102 cols
[2025-06-03 11:27:39] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-03 11:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:39] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:27:40] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:27:40] [INFO ] Redundant transitions in 6 ms returned []
Running 141 sub problems to find dead transitions.
[2025-06-03 11:27:40] [INFO ] Invariant cache hit.
[2025-06-03 11:27:40] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/244 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/244 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 203 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/244 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 141/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 344 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13577ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 13584ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 142/161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13948 ms. Remains : 102/121 places, 142/161 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-01
Stuttering criterion allowed to conclude after 3704 steps with 100 reset in 10 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-01 finished in 14051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||G(F(p2))||(F(p2)&&F((p3||G(!p4)))))))'
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 114 transition count 154
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 114 transition count 154
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 111 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 150
Applied a total of 22 rules in 10 ms. Remains 110 /121 variables (removed 11) and now considering 150/161 (removed 11) transitions.
// Phase 1: matrix 150 rows 110 cols
[2025-06-03 11:27:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-03 11:27:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:27:53] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-03 11:27:54] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-03 11:27:54] [INFO ] Invariant cache hit.
[2025-06-03 11:27:54] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/260 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 213 constraints, problems are : Problem set: 0 solved, 149 unsolved in 6674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/260 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 149/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 362 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14035ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 14037ms
Starting structural reductions in LTL mode, iteration 1 : 110/121 places, 150/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14359 ms. Remains : 110/121 places, 150/161 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p3) (NOT p2) p4), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) p4 (NOT p1)), true, (AND (NOT p2) (NOT p3) p4)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 457 ms.
Product exploration explored 100000 steps with 50000 reset in 452 ms.
Computed a total of 17 stabilizing places and 15 stable transitions
Graph (complete) has 341 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 15 stable transitions
Detected a total of 17/110 stabilizing places and 15/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 p0 (NOT p4)), (X (NOT (AND (NOT p2) (NOT p3) p4))), (X (NOT p4)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) p4))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p3), (X (NOT (AND p1 (NOT p2)))), (X p0), (X p2), (X (NOT p1)), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 26 ms. Reduced automaton from 8 states, 17 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-02 finished in 15691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U !p1)) U ((p2 U X(p0)) U X(p3))))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 112 transition count 152
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 112 transition count 152
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 107 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 107 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 105 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 105 transition count 145
Applied a total of 32 rules in 10 ms. Remains 105 /121 variables (removed 16) and now considering 145/161 (removed 16) transitions.
// Phase 1: matrix 145 rows 105 cols
[2025-06-03 11:28:09] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-03 11:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:09] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:28:09] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/121 places, 145/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 104/121 places, 145/161 transitions.
Stuttering acceptance computed with spot in 589 ms :[(NOT p3), (AND p1 (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3)), true, p1, p1, (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-03 finished in 962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(G(p1)))))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 113 transition count 153
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 113 transition count 153
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 108 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 108 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 105 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 105 transition count 145
Applied a total of 32 rules in 9 ms. Remains 105 /121 variables (removed 16) and now considering 145/161 (removed 16) transitions.
// Phase 1: matrix 145 rows 105 cols
[2025-06-03 11:28:10] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:10] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-03 11:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:10] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:28:10] [INFO ] Implicit Places using invariants and state equation in 307 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 402 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/121 places, 145/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 104/121 places, 145/161 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-05 finished in 625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 113 transition count 153
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 113 transition count 153
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 108 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 108 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 105 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 105 transition count 145
Applied a total of 32 rules in 7 ms. Remains 105 /121 variables (removed 16) and now considering 145/161 (removed 16) transitions.
[2025-06-03 11:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-03 11:28:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:11] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:28:11] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-03 11:28:11] [INFO ] Invariant cache hit.
[2025-06-03 11:28:11] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 99/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 206 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 99/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 144/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 350 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6988 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13364ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 13365ms
Starting structural reductions in LTL mode, iteration 1 : 105/121 places, 145/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13669 ms. Remains : 105/121 places, 145/161 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-06
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-06 finished in 13796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Graph (complete) has 362 edges and 121 vertex of which 117 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 117 transition count 151
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 111 transition count 151
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 22 place count 102 transition count 142
Iterating global reduction 0 with 9 rules applied. Total rules applied 31 place count 102 transition count 142
Applied a total of 31 rules in 17 ms. Remains 102 /121 variables (removed 19) and now considering 142/161 (removed 19) transitions.
// Phase 1: matrix 142 rows 102 cols
[2025-06-03 11:28:24] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 11:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:24] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:28:25] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 333 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/121 places, 142/161 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 73 transition count 114
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 60 transition count 88
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 60 transition count 88
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 95 place count 47 transition count 62
Iterating global reduction 0 with 13 rules applied. Total rules applied 108 place count 47 transition count 62
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 121 place count 34 transition count 49
Iterating global reduction 0 with 13 rules applied. Total rules applied 134 place count 34 transition count 49
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 147 place count 21 transition count 23
Iterating global reduction 0 with 13 rules applied. Total rules applied 160 place count 21 transition count 23
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 172 place count 9 transition count 11
Iterating global reduction 0 with 12 rules applied. Total rules applied 184 place count 9 transition count 11
Applied a total of 184 rules in 16 ms. Remains 9 /101 variables (removed 92) and now considering 11/142 (removed 131) transitions.
[2025-06-03 11:28:25] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2025-06-03 11:28:25] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 11:28:25] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2025-06-03 11:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 11:28:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/121 places, 11/161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 427 ms. Remains : 9/121 places, 11/161 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/9 stabilizing places and 9/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-09 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 112 transition count 152
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 112 transition count 152
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 107 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 107 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 105 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 105 transition count 145
Applied a total of 32 rules in 6 ms. Remains 105 /121 variables (removed 16) and now considering 145/161 (removed 16) transitions.
// Phase 1: matrix 145 rows 105 cols
[2025-06-03 11:28:25] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:25] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 11:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:25] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:28:25] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 357 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/121 places, 145/161 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 104/121 places, 145/161 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-11
Stuttering criterion allowed to conclude after 157 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-11 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (F(p1) U (p2 U p3)))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 114 transition count 154
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 114 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 110 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 110 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 107 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 107 transition count 147
Applied a total of 28 rules in 7 ms. Remains 107 /121 variables (removed 14) and now considering 147/161 (removed 14) transitions.
// Phase 1: matrix 147 rows 107 cols
[2025-06-03 11:28:25] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-03 11:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:28:26] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-03 11:28:26] [INFO ] Invariant cache hit.
[2025-06-03 11:28:26] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/254 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 209 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/254 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 146/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/254 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 355 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13845ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 13846ms
Starting structural reductions in LTL mode, iteration 1 : 107/121 places, 147/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14139 ms. Remains : 107/121 places, 147/161 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-12
Stuttering criterion allowed to conclude after 423 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-12 finished in 14441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1)&&(X(G(p3))||p2))||p0)))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 113 transition count 153
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 113 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 109 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 109 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 106 transition count 146
Applied a total of 30 rules in 6 ms. Remains 106 /121 variables (removed 15) and now considering 146/161 (removed 15) transitions.
// Phase 1: matrix 146 rows 106 cols
[2025-06-03 11:28:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 11:28:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:28:40] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/121 places, 146/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 357 ms. Remains : 105/121 places, 146/161 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p3), true]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 289 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Detected a total of 16/105 stabilizing places and 15/146 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-13 finished in 1298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G((p1&&X(p2)))))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 113 transition count 153
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 113 transition count 153
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 108 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 108 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 105 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 105 transition count 145
Applied a total of 32 rules in 6 ms. Remains 105 /121 variables (removed 16) and now considering 145/161 (removed 16) transitions.
// Phase 1: matrix 145 rows 105 cols
[2025-06-03 11:28:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-03 11:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:41] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-03 11:28:42] [INFO ] Implicit Places using invariants and state equation in 274 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 355 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/121 places, 145/161 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 362 ms. Remains : 104/121 places, 145/161 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-14 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&F(p2)&&p0)))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 161/161 transitions.
Graph (complete) has 362 edges and 121 vertex of which 118 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 118 transition count 152
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 112 transition count 152
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 104 transition count 144
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 104 transition count 144
Applied a total of 29 rules in 15 ms. Remains 104 /121 variables (removed 17) and now considering 144/161 (removed 17) transitions.
// Phase 1: matrix 144 rows 104 cols
[2025-06-03 11:28:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-03 11:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:42] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-03 11:28:42] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 315 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/121 places, 144/161 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 76 transition count 117
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 66 place count 64 transition count 93
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 64 transition count 93
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 53 transition count 71
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 53 transition count 71
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 111 place count 42 transition count 60
Iterating global reduction 0 with 11 rules applied. Total rules applied 122 place count 42 transition count 60
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 32 transition count 40
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 32 transition count 40
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 22 transition count 30
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 22 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 163 place count 22 transition count 30
Applied a total of 163 rules in 25 ms. Remains 22 /103 variables (removed 81) and now considering 30/144 (removed 114) transitions.
[2025-06-03 11:28:42] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 22 cols
[2025-06-03 11:28:42] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 11:28:42] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2025-06-03 11:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 11:28:42] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/121 places, 30/161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 447 ms. Remains : 22/121 places, 30/161 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-15 finished in 634 ms.
All properties solved by simple procedures.
Total runtime 97790 ms.
BK_STOP 1748950122908
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-14a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-14a, 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 r058-smll-174854064700740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-14a.tgz
mv DiscoveryGPU-PT-14a 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;