Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 46K 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 GPUForwardProgress-PT-08b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748958823350

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 13:53:45] [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 13:53:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:53:45] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-03 13:53:45] [INFO ] Transformed 188 places.
[2025-06-03 13:53:45] [INFO ] Transformed 197 transitions.
[2025-06-03 13:53:45] [INFO ] Found NUPN structural information;
[2025-06-03 13:53:45] [INFO ] Parsed PT model containing 188 places and 197 transitions and 477 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 197
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 172 transition count 182
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 172 transition count 182
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 166 transition count 176
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 166 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 166 transition count 171
Applied a total of 48 rules in 110 ms. Remains 166 /188 variables (removed 22) and now considering 171/197 (removed 26) transitions.
// Phase 1: matrix 171 rows 166 cols
[2025-06-03 13:53:46] [INFO ] Computed 9 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:53:47] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-06-03 13:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:53:47] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-03 13:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 171/336 variables, 165/174 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 1/337 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/337 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 175 constraints, problems are : Problem set: 0 solved, 170 unsolved in 18983 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 171/336 variables, 165/174 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 170/344 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 1/337 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 345 constraints, problems are : Problem set: 0 solved, 170 unsolved in 20921 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40040ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 40073ms
Starting structural reductions in LTL mode, iteration 1 : 166/188 places, 171/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41196 ms. Remains : 166/188 places, 171/197 transitions.
Support contains 44 out of 166 places after structural reductions.
[2025-06-03 13:54:27] [INFO ] Flatten gal took : 75 ms
[2025-06-03 13:54:28] [INFO ] Flatten gal took : 67 ms
[2025-06-03 13:54:28] [INFO ] Input system was already deterministic with 171 transitions.
RANDOM walk for 40000 steps (515 resets) in 2112 ms. (18 steps per ms) remains 1/41 properties
BEST_FIRST walk for 32132 steps (65 resets) in 143 ms. (223 steps per ms) remains 0/1 properties
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 252 edges and 166 vertex of which 154 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1)&&(p2||(p0&&F(p3)))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 157 transition count 162
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 157 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 157 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 155 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 155 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 154 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 154 transition count 157
Applied a total of 26 rules in 34 ms. Remains 154 /166 variables (removed 12) and now considering 157/171 (removed 14) transitions.
// Phase 1: matrix 157 rows 154 cols
[2025-06-03 13:54:29] [INFO ] Computed 9 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:29] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-03 13:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:30] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-03 13:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/310 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 163 constraints, problems are : Problem set: 0 solved, 156 unsolved in 15664 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/310 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 156/318 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 319 constraints, problems are : Problem set: 0 solved, 156 unsolved in 17864 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33568ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 33573ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 157/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34010 ms. Remains : 154/166 places, 157/171 transitions.
Stuttering acceptance computed with spot in 748 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-00 finished in 34898 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((X(p0)||((F(p1) U p2)&&(p3 U p0)))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 159 transition count 164
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 159 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 157 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 157 transition count 162
Applied a total of 18 rules in 28 ms. Remains 157 /166 variables (removed 9) and now considering 162/171 (removed 9) transitions.
// Phase 1: matrix 162 rows 157 cols
[2025-06-03 13:55:04] [INFO ] Computed 9 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:04] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-03 13:55:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:04] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-03 13:55:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 162/318 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 1/319 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/319 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 166 constraints, problems are : Problem set: 0 solved, 161 unsolved in 16457 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 162/318 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 161/326 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 1/319 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 327 constraints, problems are : Problem set: 0 solved, 161 unsolved in 17925 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34423ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 34428ms
Starting structural reductions in LTL mode, iteration 1 : 157/166 places, 162/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34830 ms. Remains : 157/166 places, 162/171 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-01
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-01 finished in 35070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(F(p1)||G(p2)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 153 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 152 transition count 154
Applied a total of 31 rules in 16 ms. Remains 152 /166 variables (removed 14) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 152 cols
[2025-06-03 13:55:39] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-03 13:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:39] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 13:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14342 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 18509 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32891ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 32893ms
Starting structural reductions in LTL mode, iteration 1 : 152/166 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33247 ms. Remains : 152/166 places, 154/171 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-02
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-02 finished in 33575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&F(G(p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 153 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 152 transition count 154
Applied a total of 31 rules in 36 ms. Remains 152 /166 variables (removed 14) and now considering 154/171 (removed 17) transitions.
[2025-06-03 13:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:56:13] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-03 13:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:56:13] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 13:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14319 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 17314 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31681ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 31683ms
Starting structural reductions in LTL mode, iteration 1 : 152/166 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32299 ms. Remains : 152/166 places, 154/171 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-03 finished in 32514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1))) U (p2&&G((p0||G(p1)))))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 153 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 152 transition count 154
Applied a total of 31 rules in 9 ms. Remains 152 /166 variables (removed 14) and now considering 154/171 (removed 17) transitions.
[2025-06-03 13:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:56:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-03 13:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:56:46] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 13:56:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 15245 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 17564 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32826ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 32827ms
Starting structural reductions in LTL mode, iteration 1 : 152/166 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33189 ms. Remains : 152/166 places, 154/171 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-04 finished in 33480 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))&&(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 157 transition count 162
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 157 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 157 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 155 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 155 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 155 transition count 157
Applied a total of 25 rules in 12 ms. Remains 155 /166 variables (removed 11) and now considering 157/171 (removed 14) transitions.
// Phase 1: matrix 157 rows 155 cols
[2025-06-03 13:57:19] [INFO ] Computed 9 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:19] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-03 13:57:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:19] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-03 13:57:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/311 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/312 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/312 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 164 constraints, problems are : Problem set: 0 solved, 156 unsolved in 15772 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/311 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 1/312 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 320 constraints, problems are : Problem set: 0 solved, 156 unsolved in 16803 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32598ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 32599ms
Starting structural reductions in LTL mode, iteration 1 : 155/166 places, 157/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33003 ms. Remains : 155/166 places, 157/171 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-05 finished in 33331 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(F((p0||G(F(p1)))))||(p2&&X(F((p0||G(F(p1)))))))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 157 transition count 162
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 157 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 154 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 154 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 153 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 153 transition count 155
Applied a total of 29 rules in 9 ms. Remains 153 /166 variables (removed 13) and now considering 155/171 (removed 16) transitions.
// Phase 1: matrix 155 rows 153 cols
[2025-06-03 13:57:52] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:52] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-03 13:57:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:52] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-03 13:57:52] [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, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 162 constraints, problems are : Problem set: 0 solved, 154 unsolved in 14809 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 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/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 154/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 316 constraints, problems are : Problem set: 0 solved, 154 unsolved in 16454 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31288ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 31289ms
Starting structural reductions in LTL mode, iteration 1 : 153/166 places, 155/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31611 ms. Remains : 153/166 places, 155/171 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 236 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 32 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-06 finished in 32593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U (G(p1)||X(F(!p2)))))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 153 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 152 transition count 154
Applied a total of 31 rules in 11 ms. Remains 152 /166 variables (removed 14) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 152 cols
[2025-06-03 13:58:25] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-03 13:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:25] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 13:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 15543 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 16136 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31705ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 31707ms
Starting structural reductions in LTL mode, iteration 1 : 152/166 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32036 ms. Remains : 152/166 places, 154/171 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 84 ms.
Product exploration explored 100000 steps with 25000 reset in 141 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
RANDOM walk for 40000 steps (496 resets) in 348 ms. (114 steps per ms) remains 1/7 properties
BEST_FIRST walk for 5042 steps (4 resets) in 25 ms. (193 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 370 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 154/154 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2025-06-03 13:58:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-03 13:58:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:59] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 13:58:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 13261 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14499 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27783ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 27784ms
Finished structural reductions in LTL mode , in 1 iterations and 28133 ms. Remains : 152/152 places, 154/154 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
RANDOM walk for 40000 steps (499 resets) in 362 ms. (110 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 337 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 154/154 transitions.
Graph (trivial) has 120 edges and 152 vertex of which 6 / 152 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 229 edges and 147 vertex of which 135 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 135 transition count 145
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 66 place count 135 transition count 147
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 135 transition count 147
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 119 place count 91 transition count 103
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 163 place count 91 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 170 place count 84 transition count 96
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 177 place count 84 transition count 96
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 204 place count 84 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 206 place count 84 transition count 95
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 226 place count 64 transition count 74
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 246 place count 64 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 247 place count 64 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 248 place count 63 transition count 73
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 249 place count 63 transition count 73
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 63 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 269 place count 51 transition count 70
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 281 place count 51 transition count 70
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 293 place count 39 transition count 50
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 305 place count 39 transition count 50
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 305 rules in 115 ms. Remains 39 /152 variables (removed 113) and now considering 50/154 (removed 104) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:59:29] [INFO ] Redundant transitions in 29 ms returned []
Running 49 sub problems to find dead transitions.
// Phase 1: matrix 50 rows 39 cols
[2025-06-03 13:59:30] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 13:59:30] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 1 (OVERLAPS) 49/87 variables, 38/38 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/39 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/39 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/40 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/41 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/41 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/41 constraints. Problems are: Problem set: 30 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 41 constraints, problems are : Problem set: 30 solved, 19 unsolved in 977 ms.
Refiners :[State Equation: 39/39 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 48/62 variables, 14/14 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/15 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 19/34 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/34 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 26/88 variables, 25/59 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/59 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/60 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/60 constraints. Problems are: Problem set: 30 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 60 constraints, problems are : Problem set: 30 solved, 19 unsolved in 1267 ms.
Refiners :[State Equation: 39/39 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 19/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2261ms problems are : Problem set: 30 solved, 19 unsolved
Search for dead transitions found 30 dead transitions in 2262ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/152 places, 20/154 transitions.
Graph (complete) has 48 edges and 39 vertex of which 15 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 15 /39 variables (removed 24) and now considering 20/20 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/152 places, 20/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2430 ms. Remains : 15/152 places, 20/154 transitions.
Built C files in :
/tmp/ltsmin10200996329117590065
[2025-06-03 13:59:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10200996329117590065
Running compilation step : cd /tmp/ltsmin10200996329117590065;'/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 876 ms.
Running link step : cd /tmp/ltsmin10200996329117590065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin10200996329117590065;'/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/stateBased8253651293033998312.hoa' '--buchi-type=spotba'
LTSmin run took 366 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-07 finished in 68642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 157 transition count 162
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 157 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 154 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 154 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 153 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 153 transition count 155
Applied a total of 29 rules in 20 ms. Remains 153 /166 variables (removed 13) and now considering 155/171 (removed 16) transitions.
// Phase 1: matrix 155 rows 153 cols
[2025-06-03 13:59:33] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:59:33] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-03 13:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:59:34] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-03 13:59:34] [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, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 162 constraints, problems are : Problem set: 0 solved, 154 unsolved in 15316 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 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/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 154/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 316 constraints, problems are : Problem set: 0 solved, 154 unsolved in 16664 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32008ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 32009ms
Starting structural reductions in LTL mode, iteration 1 : 153/166 places, 155/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32417 ms. Remains : 153/166 places, 155/171 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-09 finished in 32604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(X((p1&&X(X(G(p2))))))) U !p2)))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 153 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 152 transition count 154
Applied a total of 31 rules in 23 ms. Remains 152 /166 variables (removed 14) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 152 cols
[2025-06-03 14:00:06] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:06] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-03 14:00:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:06] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 14:00:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14567 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 18183 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32772ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 32773ms
Starting structural reductions in LTL mode, iteration 1 : 152/166 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33154 ms. Remains : 152/166 places, 154/171 transitions.
Stuttering acceptance computed with spot in 302 ms :[p2, p2, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Detected a total of 27/152 stabilizing places and 27/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-10 finished in 33734 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' '!(((p0 U p1) U X(((F(p2)&&X(!p0)) U (G((F(p2)&&X(!p0)))||(F(p2)&&X(p3)))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 158 transition count 163
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 158 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 158 transition count 162
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 155 transition count 159
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 155 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 155 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 154 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 154 transition count 156
Applied a total of 27 rules in 19 ms. Remains 154 /166 variables (removed 12) and now considering 156/171 (removed 15) transitions.
// Phase 1: matrix 156 rows 154 cols
[2025-06-03 14:00:40] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:40] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-03 14:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:40] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-06-03 14:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/309 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 1/310 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 163 constraints, problems are : Problem set: 0 solved, 155 unsolved in 14817 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/309 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 155/317 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 1/310 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 318 constraints, problems are : Problem set: 0 solved, 155 unsolved in 16362 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31202ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 31203ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 156/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31613 ms. Remains : 154/166 places, 156/171 transitions.
Stuttering acceptance computed with spot in 829 ms :[(OR (NOT p2) (AND p0 (NOT p3))), (OR (NOT p2) (AND p0 (NOT p3))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p2) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-11
Product exploration explored 100000 steps with 25044 reset in 165 ms.
Product exploration explored 100000 steps with 25022 reset in 189 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 237 edges and 154 vertex of which 142 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/154 stabilizing places and 29/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 483 ms. Reduced automaton from 14 states, 35 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 198 steps (0 resets) in 5 ms. (33 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F p3), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) p3)))]
Knowledge based reduction with 23 factoid took 1022 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Support contains 3 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-03 14:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:01:15] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-03 14:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:01:15] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-06-03 14:01: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/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/309 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 1/310 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 163 constraints, problems are : Problem set: 0 solved, 155 unsolved in 14676 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/309 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 155/317 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 1/310 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 318 constraints, problems are : Problem set: 0 solved, 155 unsolved in 17265 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31959ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 31959ms
Finished structural reductions in LTL mode , in 1 iterations and 32339 ms. Remains : 154/154 places, 156/156 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 237 edges and 154 vertex of which 142 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/154 stabilizing places and 29/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 208 steps (0 resets) in 6 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F p3), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) p3)))]
Knowledge based reduction with 5 factoid took 440 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Product exploration explored 100000 steps with 20085 reset in 154 ms.
Product exploration explored 100000 steps with 20047 reset in 223 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 156/156 transitions.
Graph (trivial) has 123 edges and 154 vertex of which 6 / 154 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 231 edges and 149 vertex of which 137 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 137 transition count 147
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 65 place count 137 transition count 149
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 137 transition count 149
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 119 place count 94 transition count 106
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 162 place count 94 transition count 106
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 169 place count 87 transition count 99
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 176 place count 87 transition count 99
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 204 place count 87 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 206 place count 87 transition count 98
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 227 place count 66 transition count 76
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 248 place count 66 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 249 place count 66 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 65 transition count 75
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 65 transition count 75
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 259 place count 65 transition count 98
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 273 place count 51 transition count 70
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 287 place count 51 transition count 70
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 305 place count 33 transition count 40
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 323 place count 33 transition count 40
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 323 rules in 54 ms. Remains 33 /154 variables (removed 121) and now considering 40/156 (removed 116) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:01:50] [INFO ] Redundant transitions in 21 ms returned []
Running 39 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 33 cols
[2025-06-03 14:01:50] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 14:01:50] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/71 variables, 32/32 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/40 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/40 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/72 variables, 1/41 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/73 variables, 1/42 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/42 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/42 constraints. Problems are: Problem set: 24 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 42 constraints, problems are : Problem set: 24 solved, 15 unsolved in 756 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 38/50 variables, 12/12 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/20 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/35 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 22/72 variables, 21/56 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/56 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/57 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/57 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/57 constraints. Problems are: Problem set: 24 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 57 constraints, problems are : Problem set: 24 solved, 15 unsolved in 874 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 15/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1639ms problems are : Problem set: 24 solved, 15 unsolved
Search for dead transitions found 24 dead transitions in 1639ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/154 places, 16/156 transitions.
Graph (complete) has 35 edges and 33 vertex of which 13 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 13 /33 variables (removed 20) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/154 places, 16/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1731 ms. Remains : 13/154 places, 16/156 transitions.
Built C files in :
/tmp/ltsmin10295264259820570115
[2025-06-03 14:01:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10295264259820570115
Running compilation step : cd /tmp/ltsmin10295264259820570115;'/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 591 ms.
Running link step : cd /tmp/ltsmin10295264259820570115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10295264259820570115;'/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/stateBased5121262146942419168.hoa' '--buchi-type=spotba'
LTSmin run took 635 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-11 finished in 73373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 158 transition count 163
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 158 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 158 transition count 162
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 155 transition count 159
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 155 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 155 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 154 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 154 transition count 156
Applied a total of 27 rules in 14 ms. Remains 154 /166 variables (removed 12) and now considering 156/171 (removed 15) transitions.
// Phase 1: matrix 156 rows 154 cols
[2025-06-03 14:01:53] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:01:53] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-03 14:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:01:53] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-06-03 14:01: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/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/309 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 1/310 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 163 constraints, problems are : Problem set: 0 solved, 155 unsolved in 15887 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/309 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 155/317 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 1/310 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 318 constraints, problems are : Problem set: 0 solved, 155 unsolved in 16510 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32415ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 32416ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 156/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32799 ms. Remains : 154/166 places, 156/171 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-12 finished in 32950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Graph (trivial) has 133 edges and 166 vertex of which 6 / 166 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 246 edges and 161 vertex of which 149 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 148 transition count 91
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 147 place count 78 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 76 transition count 86
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 149 place count 76 transition count 67
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 187 place count 57 transition count 67
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 195 place count 49 transition count 59
Iterating global reduction 3 with 8 rules applied. Total rules applied 203 place count 49 transition count 59
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 253 place count 24 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 24 transition count 33
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 259 place count 19 transition count 24
Iterating global reduction 4 with 5 rules applied. Total rules applied 264 place count 19 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 17 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 16 transition count 22
Applied a total of 269 rules in 36 ms. Remains 16 /166 variables (removed 150) and now considering 22/171 (removed 149) transitions.
[2025-06-03 14:02:26] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 16 cols
[2025-06-03 14:02:26] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:02:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 14:02:26] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2025-06-03 14:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 14:02:26] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:02:26] [INFO ] Redundant transitions in 23 ms returned []
Running 19 sub problems to find dead transitions.
[2025-06-03 14:02:26] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2025-06-03 14:02:26] [INFO ] Invariant cache hit.
[2025-06-03 14:02:26] [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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 3/36 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 17 constraints, problems are : Problem set: 0 solved, 19 unsolved in 512 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 3/36 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 36 constraints, problems are : Problem set: 0 solved, 19 unsolved in 697 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1216ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 1217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/166 places, 22/171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1374 ms. Remains : 16/166 places, 22/171 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-13
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-13 finished in 1558 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' '!(((p0 U X(X(p0))) U G((G(p1) U X(!p0)))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 153 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 152 transition count 154
Applied a total of 31 rules in 19 ms. Remains 152 /166 variables (removed 14) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 152 cols
[2025-06-03 14:02:27] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:02:28] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-03 14:02:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:02:28] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 14:02: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/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14529 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14933 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29479ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 29481ms
Starting structural reductions in LTL mode, iteration 1 : 152/166 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29874 ms. Remains : 152/166 places, 154/171 transitions.
Stuttering acceptance computed with spot in 1326 ms :[p0, false, p0, false, false, false, (AND (NOT p1) p0), p0, false, (NOT p0), true, false, (NOT p0), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), p0, p0, (AND (NOT p1) p0), p0, (NOT p0), (NOT p1), false, (AND (NOT p0) (NOT p1)), false, (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-14
Product exploration explored 100000 steps with 29883 reset in 368 ms.
Product exploration explored 100000 steps with 29953 reset in 394 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 187 ms. Reduced automaton from 26 states, 77 edges and 2 AP (stutter sensitive) to 13 states, 48 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 495 ms :[p0, (NOT p0), p0, (AND p0 (NOT p1)), p0, true, (AND (NOT p1) (NOT p0)), false, (AND p0 p1), p0, (NOT p1), (AND (NOT p1) p0), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 22126 steps (278 resets) in 67 ms. (325 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 11 factoid took 284 ms. Reduced automaton from 13 states, 48 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-14 finished in 33044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 171/171 transitions.
Graph (trivial) has 138 edges and 166 vertex of which 6 / 166 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 246 edges and 161 vertex of which 149 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 148 transition count 87
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 78 rules applied. Total rules applied 154 place count 74 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 73 transition count 83
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 155 place count 73 transition count 64
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 193 place count 54 transition count 64
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 201 place count 46 transition count 56
Iterating global reduction 3 with 8 rules applied. Total rules applied 209 place count 46 transition count 56
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 261 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 20 transition count 29
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 269 place count 13 transition count 16
Iterating global reduction 4 with 7 rules applied. Total rules applied 276 place count 13 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 280 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 10 transition count 14
Applied a total of 281 rules in 19 ms. Remains 10 /166 variables (removed 156) and now considering 14/171 (removed 157) transitions.
[2025-06-03 14:03:00] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 10 cols
[2025-06-03 14:03:00] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-03 14:03:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-03 14:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 14:03:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:03:01] [INFO ] Redundant transitions in 21 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 14:03:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-03 14:03:01] [INFO ] Invariant cache hit.
[2025-06-03 14:03:01] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 12 unsolved in 315 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 401 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 722ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/166 places, 14/171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 844 ms. Remains : 10/166 places, 14/171 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-15 finished in 960 ms.
All properties solved by simple procedures.
Total runtime 556441 ms.

BK_STOP 1748959381972

--------------------
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="GPUForwardProgress-PT-08b"
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 GPUForwardProgress-PT-08b, 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 r100-smll-174867007800404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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