Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064500636.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-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064500636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 54K 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-07b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748916988920

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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 02:16:30] [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 02:16:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:16:31] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-06-03 02:16:31] [INFO ] Transformed 212 places.
[2025-06-03 02:16:31] [INFO ] Transformed 224 transitions.
[2025-06-03 02:16:31] [INFO ] Found NUPN structural information;
[2025-06-03 02:16:31] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 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-07b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 224
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 45 place count 167 transition count 193
Iterating global reduction 1 with 31 rules applied. Total rules applied 76 place count 167 transition count 193
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 161 transition count 187
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 161 transition count 187
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 157 transition count 183
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 157 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 156 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 156 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 155 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 155 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 154 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 154 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 153 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 153 transition count 178
Applied a total of 104 rules in 172 ms. Remains 153 /212 variables (removed 59) and now considering 178/224 (removed 46) transitions.
// Phase 1: matrix 178 rows 153 cols
[2025-06-03 02:16:31] [INFO ] Computed 2 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:16:32] [INFO ] Implicit Places using invariants in 439 ms returned []
[2025-06-03 02:16:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:16:32] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-06-03 02:16:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 178/331 variables, 153/155 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:39] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:39] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:39] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:39] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:39] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:39] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 14/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 0/331 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 169 constraints, problems are : Problem set: 0 solved, 177 unsolved in 18621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/331 variables, 153/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 177/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 19775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38585ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 38608ms
Starting structural reductions in LTL mode, iteration 1 : 153/212 places, 178/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39712 ms. Remains : 153/212 places, 178/224 transitions.
Support contains 28 out of 153 places after structural reductions.
[2025-06-03 02:17:11] [INFO ] Flatten gal took : 63 ms
[2025-06-03 02:17:11] [INFO ] Flatten gal took : 26 ms
[2025-06-03 02:17:11] [INFO ] Input system was already deterministic with 178 transitions.
RANDOM walk for 6065 steps (22 resets) in 504 ms. (12 steps per ms) remains 0/27 properties
FORMULA DiscoveryGPU-PT-07b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 301 edges and 153 vertex of which 151 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((X(X(p0))&&F(p1)))))))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 170
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 140 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 140 transition count 165
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 136 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 136 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 132 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 132 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 128 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 128 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 126 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 125 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 125 transition count 146
Applied a total of 56 rules in 25 ms. Remains 125 /153 variables (removed 28) and now considering 146/178 (removed 32) transitions.
// Phase 1: matrix 146 rows 125 cols
[2025-06-03 02:17:12] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:12] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-03 02:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:12] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2025-06-03 02:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/271 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:17] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:17] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:17] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:17] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:17] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:17] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:17] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 134 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/271 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 145/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 279 constraints, problems are : Problem set: 0 solved, 145 unsolved in 9228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22050ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 22051ms
Starting structural reductions in LTL mode, iteration 1 : 125/153 places, 146/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22402 ms. Remains : 125/153 places, 146/178 transitions.
Stuttering acceptance computed with spot in 760 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-00
Product exploration explored 100000 steps with 974 reset in 547 ms.
Stack based approach found an accepted trace after 276 steps with 3 reset with depth 51 and stack size 51 in 8 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-00 finished in 23817 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((X((p1||X(p2)))||p0)))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 169
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 138 transition count 163
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 138 transition count 163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 133 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 133 transition count 155
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 128 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 128 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 123 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 123 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 121 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 120 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 120 transition count 140
Applied a total of 66 rules in 24 ms. Remains 120 /153 variables (removed 33) and now considering 140/178 (removed 38) transitions.
// Phase 1: matrix 140 rows 120 cols
[2025-06-03 02:17:36] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:36] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-03 02:17:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:36] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-03 02:17:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:40] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:40] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:40] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:40] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:40] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:40] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:40] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 129 constraints, problems are : Problem set: 0 solved, 139 unsolved in 10068 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 268 constraints, problems are : Problem set: 0 solved, 139 unsolved in 9043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19159ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 19162ms
Starting structural reductions in LTL mode, iteration 1 : 120/153 places, 140/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19465 ms. Remains : 120/153 places, 140/178 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-01
Product exploration explored 100000 steps with 621 reset in 319 ms.
Product exploration explored 100000 steps with 596 reset in 279 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
RANDOM walk for 452 steps (0 resets) in 14 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 140/140 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-03 02:17:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:57] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-03 02:17:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:57] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-03 02:17:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:00] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:01] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:01] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:01] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:01] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:01] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:01] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 129 constraints, problems are : Problem set: 0 solved, 139 unsolved in 9350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 268 constraints, problems are : Problem set: 0 solved, 139 unsolved in 9069 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18461ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 18463ms
Finished structural reductions in LTL mode , in 1 iterations and 18802 ms. Remains : 120/120 places, 140/140 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
RANDOM walk for 598 steps (0 resets) in 9 ms. (59 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Product exploration explored 100000 steps with 616 reset in 230 ms.
Product exploration explored 100000 steps with 607 reset in 415 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 140/140 transitions.
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 119 transition count 139
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 15 place count 119 transition count 139
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 37 place count 119 transition count 139
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 54 place count 119 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 117 transition count 143
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 117 transition count 143
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 117 transition count 171
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 111 transition count 159
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 111 transition count 159
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 93 transition count 129
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 93 transition count 129
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 77 transition count 103
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 77 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 72 transition count 98
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 72 transition count 98
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 63 transition count 85
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 63 transition count 85
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 194 place count 49 transition count 63
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 208 place count 49 transition count 63
Deduced a syphon composed of 26 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 210 place count 49 transition count 61
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 210 rules in 128 ms. Remains 49 /120 variables (removed 71) and now considering 61/140 (removed 79) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:18:18] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-03 02:18:18] [INFO ] Flow matrix only has 59 transitions (discarded 2 similar events)
// Phase 1: matrix 59 rows 49 cols
[2025-06-03 02:18:18] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 02:18:18] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 57 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 4 (OVERLAPS) 59/108 variables, 49/53 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 6/59 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/59 constraints. Problems are: Problem set: 34 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 59 constraints, problems are : Problem set: 34 solved, 26 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 34 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 4/26 variables, 2/2 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 2/4 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 58/84 variables, 26/30 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 6/36 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 26/62 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 24/108 variables, 23/85 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/85 constraints. Problems are: Problem set: 34 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/85 constraints. Problems are: Problem set: 34 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 85 constraints, problems are : Problem set: 34 solved, 26 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 26/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3034ms problems are : Problem set: 34 solved, 26 unsolved
Search for dead transitions found 34 dead transitions in 3035ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/120 places, 27/140 transitions.
Graph (complete) has 61 edges and 49 vertex of which 23 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 23 /49 variables (removed 26) and now considering 27/27 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/120 places, 27/140 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3178 ms. Remains : 23/120 places, 27/140 transitions.
Built C files in :
/tmp/ltsmin7338225106388206187
[2025-06-03 02:18:21] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7338225106388206187
Running compilation step : cd /tmp/ltsmin7338225106388206187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 781 ms.
Running link step : cd /tmp/ltsmin7338225106388206187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin7338225106388206187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13404766421840146969.hoa' '--buchi-type=spotba'
LTSmin run took 9335 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-01 finished in 55312 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((X(X(X(G(p0))))&&(p1||X(X(G(p2)))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 171
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 141 transition count 166
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 141 transition count 166
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 137 transition count 160
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 137 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 133 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 133 transition count 155
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 129 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 129 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 127 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 126 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 126 transition count 147
Applied a total of 54 rules in 19 ms. Remains 126 /153 variables (removed 27) and now considering 147/178 (removed 31) transitions.
// Phase 1: matrix 147 rows 126 cols
[2025-06-03 02:18:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:18:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 02:18:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:18:31] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-03 02:18:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/273 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:35] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:35] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:35] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:35] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:35] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:35] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:35] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 135 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9962 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/273 variables, 126/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/273 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 281 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10981 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20969ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 20969ms
Starting structural reductions in LTL mode, iteration 1 : 126/153 places, 147/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21210 ms. Remains : 126/153 places, 147/178 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-02 finished in 21481 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)) U G(p1)) U X(p0)))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 170
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 139 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 139 transition count 164
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 134 transition count 156
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 134 transition count 156
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 129 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 129 transition count 150
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 121 transition count 141
Applied a total of 64 rules in 17 ms. Remains 121 /153 variables (removed 32) and now considering 141/178 (removed 37) transitions.
// Phase 1: matrix 141 rows 121 cols
[2025-06-03 02:18:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:18:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-03 02:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:18:53] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2025-06-03 02:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:57] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:57] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:57] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:57] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:57] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:57] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:57] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 130 constraints, problems are : Problem set: 0 solved, 140 unsolved in 11667 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 270 constraints, problems are : Problem set: 0 solved, 140 unsolved in 10235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21929ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 21930ms
Starting structural reductions in LTL mode, iteration 1 : 121/153 places, 141/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22202 ms. Remains : 121/153 places, 141/178 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), false, (NOT p0), p0, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-03
Product exploration explored 100000 steps with 867 reset in 295 ms.
Stack based approach found an accepted trace after 597 steps with 5 reset with depth 136 and stack size 136 in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-03 finished in 22777 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 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Graph (complete) has 301 edges and 153 vertex of which 151 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 150 transition count 152
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 127 transition count 152
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 47 place count 127 transition count 129
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 93 place count 104 transition count 129
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 98 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 98 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 98 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 97 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 92 transition count 117
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 92 transition count 117
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 87 transition count 107
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 87 transition count 107
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 82 transition count 102
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 82 transition count 102
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 201 place count 50 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 207 place count 44 transition count 58
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 44 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 219 place count 38 transition count 52
Iterating global reduction 2 with 6 rules applied. Total rules applied 225 place count 38 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 231 place count 32 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 237 place count 32 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 243 place count 26 transition count 34
Iterating global reduction 2 with 6 rules applied. Total rules applied 249 place count 26 transition count 34
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 255 place count 20 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 261 place count 20 transition count 22
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 266 place count 15 transition count 17
Iterating global reduction 2 with 5 rules applied. Total rules applied 271 place count 15 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 272 place count 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 12 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 279 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 285 place count 4 transition count 6
Applied a total of 285 rules in 32 ms. Remains 4 /153 variables (removed 149) and now considering 6/178 (removed 172) transitions.
[2025-06-03 02:19:15] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2025-06-03 02:19:15] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 02:19:15] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 02:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:19:15] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 02:19:15] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 02:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 46 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/153 places, 6/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 4/153 places, 6/178 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-04 finished in 245 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 U X(p1))&&(X(X(p2))||F(p3))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 171
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 142 transition count 167
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 142 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 139 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 139 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 136 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 136 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 133 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 133 transition count 155
Applied a total of 40 rules in 9 ms. Remains 133 /153 variables (removed 20) and now considering 155/178 (removed 23) transitions.
// Phase 1: matrix 155 rows 133 cols
[2025-06-03 02:19:16] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-03 02:19:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:16] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-03 02:19:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/288 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:19] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:19] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:20] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:20] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:20] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:20] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 142 constraints, problems are : Problem set: 0 solved, 154 unsolved in 10549 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 155/288 variables, 133/142 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 154/296 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 296 constraints, problems are : Problem set: 0 solved, 154 unsolved in 12424 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23015ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 23016ms
Starting structural reductions in LTL mode, iteration 1 : 133/153 places, 155/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23258 ms. Remains : 133/153 places, 155/178 transitions.
Stuttering acceptance computed with spot in 648 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-05
Stuttering criterion allowed to conclude after 1713 steps with 25 reset in 6 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-05 finished in 23948 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||G(p1)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Graph (complete) has 301 edges and 153 vertex of which 151 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 150 transition count 153
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 128 transition count 153
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 45 place count 128 transition count 131
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 89 place count 106 transition count 131
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 100 transition count 125
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 100 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 100 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 99 transition count 124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 108 place count 94 transition count 119
Iterating global reduction 2 with 5 rules applied. Total rules applied 113 place count 94 transition count 119
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 89 transition count 109
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 89 transition count 109
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 84 transition count 104
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 84 transition count 104
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 197 place count 52 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 46 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 40 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 40 transition count 54
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 35 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 35 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 236 place count 30 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 241 place count 30 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 245 place count 26 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 249 place count 26 transition count 31
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 253 place count 22 transition count 27
Iterating global reduction 2 with 4 rules applied. Total rules applied 257 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 22 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 261 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 263 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 18 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 264 place count 18 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 268 place count 16 transition count 21
Applied a total of 268 rules in 48 ms. Remains 16 /153 variables (removed 137) and now considering 21/178 (removed 157) transitions.
[2025-06-03 02:19:40] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2025-06-03 02:19:40] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 02:19:40] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2025-06-03 02:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 02:19:40] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:19:40] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 02:19:40] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2025-06-03 02:19:40] [INFO ] Invariant cache hit.
[2025-06-03 02:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 18 constraints, problems are : Problem set: 0 solved, 20 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 38 constraints, problems are : Problem set: 0 solved, 20 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 958ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 958ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/153 places, 21/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1087 ms. Remains : 16/153 places, 21/178 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-09
Stuttering criterion allowed to conclude after 18842 steps with 811 reset in 88 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-09 finished in 1269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((!p0||X((X(X((p1&&F(p2)))) U (!p0&&X(X((p1&&F(p2)))))))))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 169
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 138 transition count 163
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 138 transition count 163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 133 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 133 transition count 155
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 128 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 128 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 123 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 123 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 121 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 120 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 120 transition count 140
Applied a total of 66 rules in 10 ms. Remains 120 /153 variables (removed 33) and now considering 140/178 (removed 38) transitions.
// Phase 1: matrix 140 rows 120 cols
[2025-06-03 02:19:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 02:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:41] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-03 02:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:45] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:45] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:45] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:45] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:45] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:45] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:45] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 129 constraints, problems are : Problem set: 0 solved, 139 unsolved in 10754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 268 constraints, problems are : Problem set: 0 solved, 139 unsolved in 10547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21320ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 21320ms
Starting structural reductions in LTL mode, iteration 1 : 120/153 places, 140/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21540 ms. Remains : 120/153 places, 140/178 transitions.
Stuttering acceptance computed with spot in 440 ms :[p0, p0, p0, p0, (OR (NOT p2) (NOT p1) p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-10 finished in 22010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U X(G(p1)))))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 141 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 141 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 138 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 138 transition count 162
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 135 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 135 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 132 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 132 transition count 154
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 130 transition count 152
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 130 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 129 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 129 transition count 151
Applied a total of 48 rules in 17 ms. Remains 129 /153 variables (removed 24) and now considering 151/178 (removed 27) transitions.
// Phase 1: matrix 151 rows 129 cols
[2025-06-03 02:20:03] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-03 02:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:03] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-03 02:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 151/280 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:07] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:07] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:07] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:08] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:08] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:08] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:08] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 138 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/280 variables, 129/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 150/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 288 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13090 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24451ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 24451ms
Starting structural reductions in LTL mode, iteration 1 : 129/153 places, 151/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24790 ms. Remains : 129/153 places, 151/178 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-11 finished in 24990 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 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Graph (complete) has 301 edges and 153 vertex of which 151 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 150 transition count 153
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 128 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 127 transition count 152
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 47 place count 127 transition count 129
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 93 place count 104 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 98 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 98 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 98 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 97 transition count 122
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 92 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 92 transition count 117
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 87 transition count 107
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 87 transition count 107
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 82 transition count 102
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 82 transition count 102
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 201 place count 50 transition count 70
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 207 place count 44 transition count 58
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 44 transition count 58
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 219 place count 38 transition count 52
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 38 transition count 52
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 33 transition count 42
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 33 transition count 42
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 240 place count 28 transition count 37
Iterating global reduction 3 with 5 rules applied. Total rules applied 245 place count 28 transition count 37
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 250 place count 23 transition count 27
Iterating global reduction 3 with 5 rules applied. Total rules applied 255 place count 23 transition count 27
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 260 place count 18 transition count 22
Iterating global reduction 3 with 5 rules applied. Total rules applied 265 place count 18 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 266 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 16 edges and 14 vertex of which 11 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 273 place count 11 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 275 place count 9 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 279 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 281 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 283 place count 5 transition count 8
Applied a total of 283 rules in 30 ms. Remains 5 /153 variables (removed 148) and now considering 8/178 (removed 170) transitions.
[2025-06-03 02:20:28] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2025-06-03 02:20:28] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-03 02:20:28] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 02:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:28] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:20:28] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 02:20:28] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 02:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 61 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 62 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/153 places, 8/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 5/153 places, 8/178 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-12 finished in 252 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((p0&&F(p1))) U G((G(p2) U p3)))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 170
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 139 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 139 transition count 164
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 135 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 135 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 131 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 131 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 127 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 125 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 124 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 124 transition count 145
Applied a total of 58 rules in 18 ms. Remains 124 /153 variables (removed 29) and now considering 145/178 (removed 33) transitions.
// Phase 1: matrix 145 rows 124 cols
[2025-06-03 02:20:28] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:28] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-03 02:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:28] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-03 02:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/269 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:33] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:33] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:33] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:33] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:33] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:34] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:34] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 133 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11856 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/269 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 144/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 277 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21825ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 21826ms
Starting structural reductions in LTL mode, iteration 1 : 124/153 places, 145/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22119 ms. Remains : 124/153 places, 145/178 transitions.
Stuttering acceptance computed with spot in 1108 ms :[(NOT p3), (NOT p3), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-14 finished in 23267 ms.
All properties solved by simple procedures.
Total runtime 260826 ms.

BK_STOP 1748917251832

--------------------
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-07b"
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-07b, 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-174854064500636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07b.tgz
mv DiscoveryGPU-PT-07b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;