About the Execution of ITS-Tools for DiscoveryGPU-PT-12a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 87558.00 | 0.00 | 0.00 | FFTFFFFFFFFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700708.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-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700708
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 43K 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-12a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748937251801
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-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 07:54:13] [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 07:54:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:54:14] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-06-03 07:54:14] [INFO ] Transformed 123 places.
[2025-06-03 07:54:14] [INFO ] Transformed 169 transitions.
[2025-06-03 07:54:14] [INFO ] Found NUPN structural information;
[2025-06-03 07:54:14] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 114 transition count 160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 114 transition count 160
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 106 transition count 152
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 106 transition count 152
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 100 transition count 140
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 100 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 100 transition count 134
Applied a total of 52 rules in 84 ms. Remains 100 /123 variables (removed 23) and now considering 134/169 (removed 35) transitions.
// Phase 1: matrix 134 rows 100 cols
[2025-06-03 07:54:14] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:14] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-06-03 07:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:15] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-03 07:54:15] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-03 07:54:15] [INFO ] Invariant cache hit.
[2025-06-03 07:54:15] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/234 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 88/190 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 190 constraints, problems are : Problem set: 0 solved, 133 unsolved in 6212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/234 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 88/190 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 133/323 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 323 constraints, problems are : Problem set: 0 solved, 133 unsolved in 6244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12536ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 12566ms
Starting structural reductions in LTL mode, iteration 1 : 100/123 places, 134/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13399 ms. Remains : 100/123 places, 134/169 transitions.
Support contains 24 out of 100 places after structural reductions.
[2025-06-03 07:54:28] [INFO ] Flatten gal took : 46 ms
[2025-06-03 07:54:28] [INFO ] Flatten gal took : 23 ms
[2025-06-03 07:54:28] [INFO ] Input system was already deterministic with 134 transitions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 2196 steps (14 resets) in 227 ms. (9 steps per ms) remains 0/25 properties
FORMULA DiscoveryGPU-PT-12a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 303 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 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(((G(p0) U p1)&&(p2||X(X(F(p3)))))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 96 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 96 transition count 130
Applied a total of 8 rules in 12 ms. Remains 96 /100 variables (removed 4) and now considering 130/134 (removed 4) transitions.
// Phase 1: matrix 130 rows 96 cols
[2025-06-03 07:54:28] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:28] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-03 07:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:29] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-03 07:54:29] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-06-03 07:54:29] [INFO ] Invariant cache hit.
[2025-06-03 07:54:29] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/226 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 87/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/226 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 185 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5338 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/226 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 87/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 129/314 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 314 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11643ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 11648ms
Starting structural reductions in LTL mode, iteration 1 : 96/100 places, 130/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12043 ms. Remains : 96/100 places, 130/134 transitions.
Stuttering acceptance computed with spot in 482 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-00 finished in 12619 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(p0)) U (G((p1 U p2))||(p1 U X(p3)))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 96 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 96 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 91 transition count 125
Applied a total of 18 rules in 17 ms. Remains 91 /100 variables (removed 9) and now considering 125/134 (removed 9) transitions.
// Phase 1: matrix 125 rows 91 cols
[2025-06-03 07:54:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-03 07:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:41] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:54:41] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-03 07:54:41] [INFO ] Invariant cache hit.
[2025-06-03 07:54:41] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 178 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 124/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 302 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10711ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 10713ms
Starting structural reductions in LTL mode, iteration 1 : 91/100 places, 125/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10983 ms. Remains : 91/100 places, 125/134 transitions.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-03
Stuttering criterion allowed to conclude after 5400 steps with 340 reset in 51 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-03 finished in 11433 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(F((G(F(p0))||(F(p0)&&X((!p1&&X(!p2)))))))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 90 transition count 124
Applied a total of 20 rules in 11 ms. Remains 90 /100 variables (removed 10) and now considering 124/134 (removed 10) transitions.
// Phase 1: matrix 124 rows 90 cols
[2025-06-03 07:54:52] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 07:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:53] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:54:53] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 315 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/100 places, 124/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 328 ms. Remains : 89/100 places, 124/134 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-04
Stuttering criterion allowed to conclude after 330 steps with 11 reset in 4 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-04 finished in 658 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 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Graph (complete) has 303 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 97 transition count 127
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 93 transition count 127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 88 transition count 122
Applied a total of 19 rules in 34 ms. Remains 88 /100 variables (removed 12) and now considering 122/134 (removed 12) transitions.
// Phase 1: matrix 122 rows 88 cols
[2025-06-03 07:54:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-03 07:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:53] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:54:53] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/100 places, 122/134 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 6 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 54 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 54 transition count 79
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 44 transition count 59
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 44 transition count 59
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 34 transition count 49
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 34 transition count 49
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 24 transition count 29
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 24 transition count 29
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 14 transition count 19
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 14 transition count 19
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 147 place count 14 transition count 19
Applied a total of 147 rules in 46 ms. Remains 14 /87 variables (removed 73) and now considering 19/122 (removed 103) transitions.
[2025-06-03 07:54:53] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2025-06-03 07:54:53] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 07:54:53] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2025-06-03 07:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 07:54:53] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/100 places, 19/134 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 482 ms. Remains : 14/100 places, 19/134 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-05 finished in 554 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)||X(X(X(X(F(!p1)))))) U p2))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 90 transition count 124
Applied a total of 20 rules in 13 ms. Remains 90 /100 variables (removed 10) and now considering 124/134 (removed 10) transitions.
// Phase 1: matrix 124 rows 90 cols
[2025-06-03 07:54:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-03 07:54:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:54:54] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:54:54] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-03 07:54:54] [INFO ] Invariant cache hit.
[2025-06-03 07:54:54] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 177 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 123/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 300 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5401 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10391ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 10393ms
Starting structural reductions in LTL mode, iteration 1 : 90/100 places, 124/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10671 ms. Remains : 90/100 places, 124/134 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (NOT p2) (AND (NOT p0) p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-06
Product exploration explored 100000 steps with 5901 reset in 488 ms.
Stack based approach found an accepted trace after 198 steps with 11 reset with depth 30 and stack size 30 in 2 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-06 finished in 11398 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 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Graph (complete) has 303 edges and 100 vertex of which 97 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 97 transition count 127
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 93 transition count 127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 88 transition count 122
Applied a total of 19 rules in 16 ms. Remains 88 /100 variables (removed 12) and now considering 122/134 (removed 12) transitions.
// Phase 1: matrix 122 rows 88 cols
[2025-06-03 07:55:05] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:05] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-03 07:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:05] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:55:05] [INFO ] Implicit Places using invariants and state equation in 202 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 287 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/100 places, 122/134 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 63 transition count 98
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 52 transition count 76
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 52 transition count 76
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 41 transition count 54
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 41 transition count 54
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 30 transition count 43
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 30 transition count 43
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 125 place count 19 transition count 21
Iterating global reduction 0 with 11 rules applied. Total rules applied 136 place count 19 transition count 21
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 146 place count 9 transition count 11
Iterating global reduction 0 with 10 rules applied. Total rules applied 156 place count 9 transition count 11
Applied a total of 156 rules in 12 ms. Remains 9 /87 variables (removed 78) and now considering 11/122 (removed 111) transitions.
[2025-06-03 07:55:05] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2025-06-03 07:55:05] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-03 07:55:05] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2025-06-03 07:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 07:55:05] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/100 places, 11/134 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 433 ms. Remains : 9/100 places, 11/134 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-07 finished in 520 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((F(G((p1 U p2)))&&p0))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 96 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 96 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 91 transition count 125
Applied a total of 18 rules in 23 ms. Remains 91 /100 variables (removed 9) and now considering 125/134 (removed 9) transitions.
// Phase 1: matrix 125 rows 91 cols
[2025-06-03 07:55:06] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:06] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 07:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:06] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:55:06] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-03 07:55:06] [INFO ] Invariant cache hit.
[2025-06-03 07:55:06] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 178 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 124/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 302 constraints, problems are : Problem set: 0 solved, 124 unsolved in 8357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15034ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 15035ms
Starting structural reductions in LTL mode, iteration 1 : 91/100 places, 125/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15319 ms. Remains : 91/100 places, 125/134 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-08
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-08 finished in 15631 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(p1))||p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 90 transition count 124
Applied a total of 20 rules in 7 ms. Remains 90 /100 variables (removed 10) and now considering 124/134 (removed 10) transitions.
// Phase 1: matrix 124 rows 90 cols
[2025-06-03 07:55:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:21] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-03 07:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:21] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:55:22] [INFO ] Implicit Places using invariants and state equation in 312 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 437 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/100 places, 124/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 89/100 places, 124/134 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-09
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-09 finished in 628 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(((!p1 U (p2||G(!p1)))||p0)))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Graph (complete) has 303 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 97 transition count 128
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 94 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 90 transition count 124
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 90 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 89 transition count 123
Applied a total of 17 rules in 18 ms. Remains 89 /100 variables (removed 11) and now considering 123/134 (removed 11) transitions.
// Phase 1: matrix 123 rows 89 cols
[2025-06-03 07:55:22] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 07:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:22] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:55:22] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:55:22] [INFO ] Redundant transitions in 4 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-03 07:55:22] [INFO ] Invariant cache hit.
[2025-06-03 07:55:22] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 176 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7697 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 122/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 298 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15275ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 15276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/100 places, 123/134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15561 ms. Remains : 89/100 places, 123/134 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 60967 steps with 525 reset in 341 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-10 finished in 16053 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(G(p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Graph (complete) has 303 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 97 transition count 127
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 93 transition count 127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 88 transition count 122
Applied a total of 19 rules in 20 ms. Remains 88 /100 variables (removed 12) and now considering 122/134 (removed 12) transitions.
// Phase 1: matrix 122 rows 88 cols
[2025-06-03 07:55:38] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-03 07:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:38] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:55:38] [INFO ] Implicit Places using invariants and state equation in 255 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 360 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/100 places, 122/134 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 53 transition count 77
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 53 transition count 77
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 42 transition count 55
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 42 transition count 55
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 31 transition count 44
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 31 transition count 44
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 21 transition count 24
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 21 transition count 24
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 142 place count 11 transition count 14
Iterating global reduction 0 with 10 rules applied. Total rules applied 152 place count 11 transition count 14
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 153 place count 11 transition count 14
Applied a total of 153 rules in 15 ms. Remains 11 /87 variables (removed 76) and now considering 14/122 (removed 108) transitions.
[2025-06-03 07:55:38] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2025-06-03 07:55:38] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 07:55:38] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-03 07:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 07:55:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/100 places, 14/134 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 475 ms. Remains : 11/100 places, 14/134 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-11 finished in 543 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(G((F(p1)&&p0))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 90 transition count 124
Applied a total of 20 rules in 5 ms. Remains 90 /100 variables (removed 10) and now considering 124/134 (removed 10) transitions.
// Phase 1: matrix 124 rows 90 cols
[2025-06-03 07:55:38] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:38] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-03 07:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:55:39] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:55:39] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/100 places, 124/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 89/100 places, 124/134 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-14 finished in 511 ms.
All properties solved by simple procedures.
Total runtime 85530 ms.
BK_STOP 1748937339359
--------------------
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-12a"
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-12a, 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-174854064700708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12a.tgz
mv DiscoveryGPU-PT-12a 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 ;