Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.8K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K 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 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 667K 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 Anderson-PT-08-LTLFireability-00
FORMULA_NAME Anderson-PT-08-LTLFireability-01
FORMULA_NAME Anderson-PT-08-LTLFireability-02
FORMULA_NAME Anderson-PT-08-LTLFireability-03
FORMULA_NAME Anderson-PT-08-LTLFireability-04
FORMULA_NAME Anderson-PT-08-LTLFireability-05
FORMULA_NAME Anderson-PT-08-LTLFireability-06
FORMULA_NAME Anderson-PT-08-LTLFireability-07
FORMULA_NAME Anderson-PT-08-LTLFireability-08
FORMULA_NAME Anderson-PT-08-LTLFireability-09
FORMULA_NAME Anderson-PT-08-LTLFireability-10
FORMULA_NAME Anderson-PT-08-LTLFireability-11
FORMULA_NAME Anderson-PT-08-LTLFireability-12
FORMULA_NAME Anderson-PT-08-LTLFireability-13
FORMULA_NAME Anderson-PT-08-LTLFireability-14
FORMULA_NAME Anderson-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748543555230

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 18:32:36] [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-05-29 18:32:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:32:36] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2025-05-29 18:32:36] [INFO ] Transformed 401 places.
[2025-05-29 18:32:36] [INFO ] Transformed 1328 transitions.
[2025-05-29 18:32:36] [INFO ] Found NUPN structural information;
[2025-05-29 18:32:36] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 312 transition count 763
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 312 transition count 763
Applied a total of 178 rules in 79 ms. Remains 312 /401 variables (removed 89) and now considering 763/1328 (removed 565) transitions.
// Phase 1: matrix 763 rows 312 cols
[2025-05-29 18:32:36] [INFO ] Computed 19 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:32:37] [INFO ] Implicit Places using invariants in 424 ms returned []
[2025-05-29 18:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:32:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:32:38] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
Running 755 sub problems to find dead transitions.
[2025-05-29 18:32:38] [INFO ] Invariant cache hit.
[2025-05-29 18:32:38] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:44] [INFO ] Deduced a trap composed of 83 places in 284 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:44] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:44] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:45] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:45] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:45] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:45] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:46] [INFO ] Deduced a trap composed of 101 places in 187 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:46] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:46] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:46] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:47] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:47] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:47] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:47] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:48] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:48] [INFO ] Deduced a trap composed of 101 places in 201 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:48] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:48] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:49] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:49] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:50] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:50] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:50] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:50] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:51] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:51] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:51] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 92 places in 192 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 101 places in 183 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/1075 variables, and 59 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/312 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 755 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:18] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:18] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:18] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:19] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:19] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:19] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:19] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:21] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:29] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/1075 variables, and 68 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/312 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/755 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60801ms problems are : Problem set: 0 solved, 755 unsolved
Search for dead transitions found 0 dead transitions in 60817ms
Starting structural reductions in LTL mode, iteration 1 : 312/401 places, 763/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62716 ms. Remains : 312/401 places, 763/1328 transitions.
Support contains 47 out of 312 places after structural reductions.
[2025-05-29 18:33:39] [INFO ] Flatten gal took : 84 ms
[2025-05-29 18:33:39] [INFO ] Flatten gal took : 50 ms
[2025-05-29 18:33:39] [INFO ] Input system was already deterministic with 763 transitions.
RANDOM walk for 40000 steps (8 resets) in 2655 ms. (15 steps per ms) remains 17/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 12/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 9/9 properties
[2025-05-29 18:33:40] [INFO ] Invariant cache hit.
[2025-05-29 18:33:40] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 203/221 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 80/301 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 11/312 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:41] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:41] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 34 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:41] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:42] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 27 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 763/1075 variables, 312/335 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1075 variables, 56/391 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1075 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1075 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1075/1075 variables, and 391 constraints, problems are : Problem set: 1 solved, 8 unsolved in 2490 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 312/312 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 204/220 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 80/300 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 12/312 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 763/1075 variables, 312/335 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1075 variables, 56/391 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1075 variables, 8/399 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1075 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1075 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1075/1075 variables, and 399 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 312/312 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7517ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 763/763 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 312 transition count 707
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 256 transition count 707
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 126 place count 242 transition count 511
Iterating global reduction 0 with 14 rules applied. Total rules applied 140 place count 242 transition count 511
Applied a total of 140 rules in 57 ms. Remains 242 /312 variables (removed 70) and now considering 511/763 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 242/312 places, 511/763 transitions.
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
// Phase 1: matrix 511 rows 242 cols
[2025-05-29 18:33:48] [INFO ] Computed 19 invariants in 7 ms
[2025-05-29 18:33:48] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 93/227 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 15/242 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:49] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:49] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 511/753 variables, 242/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 56/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/753 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/753 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 319 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 242/242 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 93/227 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 15/242 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 511/753 variables, 242/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 56/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/753 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/753 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/753 variables, and 324 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 242/242 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2155ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 760 ms.
Support contains 6 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 511/511 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 237 transition count 436
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 237 transition count 436
Applied a total of 10 rules in 19 ms. Remains 237 /242 variables (removed 5) and now considering 436/511 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 237/242 places, 436/511 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 983985 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :3 out of 4
Probabilistic random walk after 983985 steps, saw 616634 distinct states, run finished after 3005 ms. (steps per millisecond=327 ) properties seen :3
// Phase 1: matrix 436 rows 237 cols
[2025-05-29 18:33:54] [INFO ] Computed 19 invariants in 10 ms
[2025-05-29 18:33:54] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/221 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/237 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:55] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 436/673 variables, 237/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 56/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/673 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 237/237 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/221 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/237 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 436/673 variables, 237/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 56/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/673 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/673 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 237/237 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 436/436 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 234 transition count 391
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 234 transition count 391
Applied a total of 6 rules in 16 ms. Remains 234 /237 variables (removed 3) and now considering 391/436 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 234/237 places, 391/436 transitions.
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 756153 steps, run visited all 1 properties in 1790 ms. (steps per millisecond=422 )
Probabilistic random walk after 756153 steps, saw 491539 distinct states, run finished after 1794 ms. (steps per millisecond=421 ) properties seen :1
FORMULA Anderson-PT-08-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Anderson-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 312 transition count 707
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 256 transition count 707
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 134 place count 234 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 156 place count 234 transition count 391
Applied a total of 156 rules in 31 ms. Remains 234 /312 variables (removed 78) and now considering 391/763 (removed 372) transitions.
// Phase 1: matrix 391 rows 234 cols
[2025-05-29 18:33:58] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:33:58] [INFO ] Implicit Places using invariants in 235 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/312 places, 391/763 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 233 transition count 328
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 170 transition count 328
Applied a total of 126 rules in 21 ms. Remains 170 /233 variables (removed 63) and now considering 328/391 (removed 63) transitions.
// Phase 1: matrix 328 rows 170 cols
[2025-05-29 18:33:58] [INFO ] Computed 18 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:33:58] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-29 18:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:33:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:33:58] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 170/312 places, 328/763 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 941 ms. Remains : 170/312 places, 328/763 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 236 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-00 finished in 1387 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((X(p0)&&F(p1)))&&F(p2))))'
Support contains 8 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 292 transition count 477
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 292 transition count 477
Applied a total of 40 rules in 10 ms. Remains 292 /312 variables (removed 20) and now considering 477/763 (removed 286) transitions.
// Phase 1: matrix 477 rows 292 cols
[2025-05-29 18:33:59] [INFO ] Computed 19 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:33:59] [INFO ] Implicit Places using invariants in 297 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/312 places, 477/763 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 314 ms. Remains : 291/312 places, 477/763 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-01 finished in 758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 291 transition count 462
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 291 transition count 462
Applied a total of 42 rules in 14 ms. Remains 291 /312 variables (removed 21) and now considering 462/763 (removed 301) transitions.
// Phase 1: matrix 462 rows 291 cols
[2025-05-29 18:34:00] [INFO ] Computed 19 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:34:00] [INFO ] Implicit Places using invariants in 255 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/312 places, 462/763 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 290/312 places, 462/763 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 206 ms.
Stack based approach found an accepted trace after 149 steps with 0 reset with depth 150 and stack size 150 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-02 finished in 707 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((G(!p0) U X(X(X(!p1))))))'
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 291 transition count 462
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 291 transition count 462
Applied a total of 42 rules in 12 ms. Remains 291 /312 variables (removed 21) and now considering 462/763 (removed 301) transitions.
// Phase 1: matrix 462 rows 291 cols
[2025-05-29 18:34:00] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:34:01] [INFO ] Implicit Places using invariants in 283 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/312 places, 462/763 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 290/312 places, 462/763 transitions.
Stuttering acceptance computed with spot in 355 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Running random walk in product with property : Anderson-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 20036 reset in 212 ms.
Product exploration explored 100000 steps with 20013 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 9 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
// Phase 1: matrix 462 rows 290 cols
[2025-05-29 18:34:02] [INFO ] Computed 18 invariants in 5 ms
[2025-05-29 18:34:02] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/269 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/283 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/290 variables, 7/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 462/752 variables, 290/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 56/364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/752 variables, 0/364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/752 variables, and 364 constraints, problems are : Problem set: 1 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/269 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/283 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/290 variables, 7/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 462/752 variables, 290/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 56/364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/752 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 752/752 variables, and 365 constraints, problems are : Problem set: 1 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 692ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 462/462 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 290 transition count 400
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 228 transition count 400
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 124 place count 228 transition count 344
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 236 place count 172 transition count 344
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 172 transition count 342
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 240 place count 170 transition count 342
Applied a total of 240 rules in 20 ms. Remains 170 /290 variables (removed 120) and now considering 342/462 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 170/290 places, 342/462 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31100 steps (6 resets) in 30 ms. (1003 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Stuttering acceptance computed with spot in 330 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Applied a total of 0 rules in 15 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-05-29 18:34:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:34:04] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-29 18:34:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:34:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:34:05] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
Running 454 sub problems to find dead transitions.
[2025-05-29 18:34:05] [INFO ] Invariant cache hit.
[2025-05-29 18:34:05] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:08] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:14] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:19] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:20] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (OVERLAPS) 462/752 variables, 290/319 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 56/375 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 375 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/752 variables, and 29 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/290 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/454 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in LTL mode , in 1 iterations and 61609 ms. Remains : 290/290 places, 462/462 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2025-05-29 18:35:06] [INFO ] Invariant cache hit.
[2025-05-29 18:35:06] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/269 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/283 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/290 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 462/752 variables, 290/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 56/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/752 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/752 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/269 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/283 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/290 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 462/752 variables, 290/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 56/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/752 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 752/752 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 828ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 462/462 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 290 transition count 400
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 228 transition count 400
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 124 place count 228 transition count 344
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 236 place count 172 transition count 344
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 172 transition count 342
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 240 place count 170 transition count 342
Applied a total of 240 rules in 19 ms. Remains 170 /290 variables (removed 120) and now considering 342/462 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 170/290 places, 342/462 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 9773 steps (1 resets) in 11 ms. (814 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Stuttering acceptance computed with spot in 270 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Stuttering acceptance computed with spot in 271 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Product exploration explored 100000 steps with 19993 reset in 166 ms.
Product exploration explored 100000 steps with 20011 reset in 176 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true]
Stuttering acceptance computed with spot in 284 ms :[p1, p1, p1, p1, p1, true, p1, p1, p0]
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 290 transition count 462
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 56 Pre rules applied. Total rules applied 62 place count 290 transition count 462
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 118 place count 290 transition count 462
Deduced a syphon composed of 118 places in 1 ms
Applied a total of 118 rules in 23 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:35:09] [INFO ] Redundant transitions in 31 ms returned []
Running 454 sub problems to find dead transitions.
// Phase 1: matrix 462 rows 290 cols
[2025-05-29 18:35:09] [INFO ] Computed 18 invariants in 4 ms
[2025-05-29 18:35:09] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:11] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:11] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:11] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:12] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:12] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:12] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:13] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:13] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:13] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 18 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:14] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 15/33 constraints. Problems are: Problem set: 118 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:15] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:16] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 2/35 constraints. Problems are: Problem set: 118 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:20] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:20] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 2/37 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/37 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 462/752 variables, 290/327 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 104/431 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/431 constraints. Problems are: Problem set: 118 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 431 constraints, problems are : Problem set: 118 solved, 336 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 290/290 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 118 solved, 336 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 19/19 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/19 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 118/290 variables, 9/28 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 9/37 constraints. Problems are: Problem set: 118 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/37 constraints. Problems are: Problem set: 118 solved, 336 unsolved
SMT process timed out in 60126ms, After SMT, problems are : Problem set: 118 solved, 336 unsolved
Search for dead transitions found 118 dead transitions in 60129ms
Found 118 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 118 transitions
Dead transitions reduction (with SMT) removed 118 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 290/290 places, 344/462 transitions.
Graph (complete) has 911 edges and 290 vertex of which 172 are kept as prefixes of interest. Removing 118 places using SCC suffix rule.2 ms
Discarding 118 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 172 /290 variables (removed 118) and now considering 344/344 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 172/290 places, 344/462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60232 ms. Remains : 172/290 places, 344/462 transitions.
Built C files in :
/tmp/ltsmin14808953323644758026
[2025-05-29 18:36:09] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14808953323644758026
Running compilation step : cd /tmp/ltsmin14808953323644758026;'/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 811 ms.
Running link step : cd /tmp/ltsmin14808953323644758026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14808953323644758026;'/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/stateBased9822990563500386233.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 290 cols
[2025-05-29 18:36:24] [INFO ] Computed 18 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:36:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-05-29 18:36:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:36:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:36:25] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Running 454 sub problems to find dead transitions.
[2025-05-29 18:36:25] [INFO ] Invariant cache hit.
[2025-05-29 18:36:25] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:29] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:29] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:29] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:30] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:30] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:31] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:32] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:33] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:34] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:39] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:40] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (OVERLAPS) 462/752 variables, 290/319 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 56/375 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 375 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/752 variables, and 29 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/290 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/454 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in LTL mode , in 1 iterations and 61599 ms. Remains : 290/290 places, 462/462 transitions.
Built C files in :
/tmp/ltsmin3944658722198782329
[2025-05-29 18:37:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3944658722198782329
Running compilation step : cd /tmp/ltsmin3944658722198782329;'/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 715 ms.
Running link step : cd /tmp/ltsmin3944658722198782329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3944658722198782329;'/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/stateBased8752268772091593797.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 18:37:41] [INFO ] Flatten gal took : 20 ms
[2025-05-29 18:37:41] [INFO ] Flatten gal took : 19 ms
[2025-05-29 18:37:41] [INFO ] Time to serialize gal into /tmp/LTL4236307223885379915.gal : 5 ms
[2025-05-29 18:37:41] [INFO ] Time to serialize properties into /tmp/LTL1099140016912236851.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4236307223885379915.gal' '-t' 'CGAL' '-hoa' '/tmp/aut998899421192982754.hoa' '-atoms' '/tmp/LTL1099140016912236851.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL1099140016912236851.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut998899421192982754.hoa
Detected timeout of ITS tools.
[2025-05-29 18:37:56] [INFO ] Flatten gal took : 20 ms
[2025-05-29 18:37:56] [INFO ] Flatten gal took : 19 ms
[2025-05-29 18:37:56] [INFO ] Time to serialize gal into /tmp/LTL7186708254883585071.gal : 4 ms
[2025-05-29 18:37:56] [INFO ] Time to serialize properties into /tmp/LTL12225996903487759416.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7186708254883585071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12225996903487759416.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((G(!("((next_2==1)&&(ncs_7_4==1))")))U(X(X(X(!("(((!((next_2==1)&&(ncs_7_4==1)))&&(next_11==1))&&(ncs_1_4==1))"))))))))
Formula 0 simplified : F(F"((next_2==1)&&(ncs_7_4==1))" R XXX"(((!((next_2==1)&&(ncs_7_4==1)))&&(next_11==1))&&(ncs_1_4==1))")
Detected timeout of ITS tools.
[2025-05-29 18:38:11] [INFO ] Flatten gal took : 17 ms
[2025-05-29 18:38:11] [INFO ] Applying decomposition
[2025-05-29 18:38:11] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15266163169886388195.txt' '-o' '/tmp/graph15266163169886388195.bin' '-w' '/tmp/graph15266163169886388195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15266163169886388195.bin' '-l' '-1' '-v' '-w' '/tmp/graph15266163169886388195.weights' '-q' '0' '-e' '0.001'
[2025-05-29 18:38:11] [INFO ] Decomposing Gal with order
[2025-05-29 18:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 18:38:11] [INFO ] Removed a total of 766 redundant transitions.
[2025-05-29 18:38:11] [INFO ] Flatten gal took : 85 ms
[2025-05-29 18:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 17 ms.
[2025-05-29 18:38:11] [INFO ] Time to serialize gal into /tmp/LTL6962610148597808797.gal : 8 ms
[2025-05-29 18:38:11] [INFO ] Time to serialize properties into /tmp/LTL4014634220857771251.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6962610148597808797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4014634220857771251.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((G(!("((i0.i0.u0.next_2==1)&&(i0.i1.u81.ncs_7_4==1))")))U(X(X(X(!("(((!((i0.i0.u0.next_2==1)&&(i0.i1.u81.ncs_7_4==1)))&&(i0.i1.u5...199
Formula 0 simplified : F(F"((i0.i0.u0.next_2==1)&&(i0.i1.u81.ncs_7_4==1))" R XXX"(((!((i0.i0.u0.next_2==1)&&(i0.i1.u81.ncs_7_4==1)))&&(i0.i1.u5.next_11==1)...180
Detected timeout of ITS tools.
Treatment of property Anderson-PT-08-LTLFireability-03 finished in 266113 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(G(F(!(X(G(X(X(X(p0))))) U !p1)))))'
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 312 transition count 707
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 256 transition count 707
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 134 place count 234 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 156 place count 234 transition count 391
Applied a total of 156 rules in 23 ms. Remains 234 /312 variables (removed 78) and now considering 391/763 (removed 372) transitions.
// Phase 1: matrix 391 rows 234 cols
[2025-05-29 18:38:26] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:38:27] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-05-29 18:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:38:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:38:28] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:38:28] [INFO ] Redundant transitions in 10 ms returned []
Running 383 sub problems to find dead transitions.
[2025-05-29 18:38:28] [INFO ] Invariant cache hit.
[2025-05-29 18:38:28] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:30] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:32] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:32] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:33] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:33] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 391/625 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 56/318 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 9 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/625 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:55] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/625 variables, and 322 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 234/234 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:11] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:12] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/625 variables, and 34 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/234 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/383 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 234/312 places, 391/763 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61507 ms. Remains : 234/312 places, 391/763 transitions.
Stuttering acceptance computed with spot in 364 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-04
Product exploration explored 100000 steps with 34 reset in 153 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-04 finished in 62053 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)&&F(G(p1)))))'
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 0 place count 312 transition count 708
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 257 transition count 708
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 132 place count 235 transition count 392
Iterating global reduction 0 with 22 rules applied. Total rules applied 154 place count 235 transition count 392
Applied a total of 154 rules in 30 ms. Remains 235 /312 variables (removed 77) and now considering 392/763 (removed 371) transitions.
// Phase 1: matrix 392 rows 235 cols
[2025-05-29 18:39:29] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:29] [INFO ] Implicit Places using invariants in 224 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/312 places, 392/763 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 234 transition count 345
Reduce places removed 47 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 55 rules applied. Total rules applied 102 place count 187 transition count 337
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 110 place count 179 transition count 337
Applied a total of 110 rules in 8 ms. Remains 179 /234 variables (removed 55) and now considering 337/392 (removed 55) transitions.
// Phase 1: matrix 337 rows 179 cols
[2025-05-29 18:39:29] [INFO ] Computed 18 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:29] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-29 18:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:39:30] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 179/312 places, 337/763 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1060 ms. Remains : 179/312 places, 337/763 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-05
Product exploration explored 100000 steps with 2 reset in 140 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-05 finished in 1344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 312 transition count 707
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 256 transition count 707
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 135 place count 233 transition count 376
Iterating global reduction 0 with 23 rules applied. Total rules applied 158 place count 233 transition count 376
Applied a total of 158 rules in 18 ms. Remains 233 /312 variables (removed 79) and now considering 376/763 (removed 387) transitions.
// Phase 1: matrix 376 rows 233 cols
[2025-05-29 18:39:30] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:30] [INFO ] Implicit Places using invariants in 231 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 232 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/312 places, 376/763 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 232 transition count 328
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 184 transition count 320
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 176 transition count 320
Applied a total of 112 rules in 8 ms. Remains 176 /232 variables (removed 56) and now considering 320/376 (removed 56) transitions.
// Phase 1: matrix 320 rows 176 cols
[2025-05-29 18:39:30] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:30] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-29 18:39:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:39:31] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 176/312 places, 320/763 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 891 ms. Remains : 176/312 places, 320/763 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 6447 steps with 0 reset with depth 6448 and stack size 4940 in 12 ms.
FORMULA Anderson-PT-08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-07 finished in 1099 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||X(G(p1))))&&(G(p2) U p3))))'
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 293 transition count 492
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 293 transition count 492
Applied a total of 38 rules in 13 ms. Remains 293 /312 variables (removed 19) and now considering 492/763 (removed 271) transitions.
// Phase 1: matrix 492 rows 293 cols
[2025-05-29 18:39:31] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:31] [INFO ] Implicit Places using invariants in 258 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 292/312 places, 492/763 transitions.
Applied a total of 0 rules in 3 ms. Remains 292 /292 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 278 ms. Remains : 292/312 places, 492/763 transitions.
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 164 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-08 finished in 948 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 G(p1))&&(X(p1) U G(p2))))'
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 292 transition count 477
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 292 transition count 477
Applied a total of 40 rules in 16 ms. Remains 292 /312 variables (removed 20) and now considering 477/763 (removed 286) transitions.
// Phase 1: matrix 477 rows 292 cols
[2025-05-29 18:39:32] [INFO ] Computed 19 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:32] [INFO ] Implicit Places using invariants in 302 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 316 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/312 places, 477/763 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 337 ms. Remains : 291/312 places, 477/763 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p2)), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-11 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1&&X(F(p1)))||G(F(p1))))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 291 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 291 transition count 448
Applied a total of 42 rules in 12 ms. Remains 291 /312 variables (removed 21) and now considering 448/763 (removed 315) transitions.
// Phase 1: matrix 448 rows 291 cols
[2025-05-29 18:39:33] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:33] [INFO ] Implicit Places using invariants in 253 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/312 places, 448/763 transitions.
Applied a total of 0 rules in 4 ms. Remains 290 /290 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 296 ms. Remains : 290/312 places, 448/763 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Product exploration explored 100000 steps with 33333 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-12 finished in 770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 763/763 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 291 transition count 462
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 291 transition count 462
Applied a total of 42 rules in 13 ms. Remains 291 /312 variables (removed 21) and now considering 462/763 (removed 301) transitions.
// Phase 1: matrix 462 rows 291 cols
[2025-05-29 18:39:33] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:34] [INFO ] Implicit Places using invariants in 323 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/312 places, 462/763 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 290/312 places, 462/763 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-13 finished in 480 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((G(!p0) U X(X(X(!p1))))))'
[2025-05-29 18:39:34] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
[2025-05-29 18:39:34] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin6015568255040542878
[2025-05-29 18:39:34] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2025-05-29 18:39:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:39:34] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2025-05-29 18:39:34] [INFO ] Flatten gal took : 58 ms
[2025-05-29 18:39:34] [INFO ] Computation of Complete enable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9235640020647340270.txt' '-o' '/tmp/graph9235640020647340270.bin' '-w' '/tmp/graph9235640020647340270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9235640020647340270.bin' '-l' '-1' '-v' '-w' '/tmp/graph9235640020647340270.weights' '-q' '0' '-e' '0.001'
[2025-05-29 18:39:34] [INFO ] Decomposing Gal with order
[2025-05-29 18:39:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 18:39:34] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
[2025-05-29 18:39:34] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:39:34] [INFO ] Built C files in 277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6015568255040542878
Running compilation step : cd /tmp/ltsmin6015568255040542878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-05-29 18:39:34] [INFO ] Removed a total of 1268 redundant transitions.
[2025-05-29 18:39:34] [INFO ] Flatten gal took : 93 ms
[2025-05-29 18:39:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 24 ms.
[2025-05-29 18:39:34] [INFO ] Time to serialize gal into /tmp/LTLFireability14525718557293747949.gal : 9 ms
[2025-05-29 18:39:34] [INFO ] Time to serialize properties into /tmp/LTLFireability17579706543277982728.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14525718557293747949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17579706543277982728.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((G(!("((i1.u2.next_2==1)&&(i9.u54.ncs_7_4==1))")))U(X(X(X(!("(((!((i1.u2.next_2==1)&&(i9.u54.ncs_7_4==1)))&&(i2.u5.next_11==1))&&...183
Formula 0 simplified : F(F"((i1.u2.next_2==1)&&(i9.u54.ncs_7_4==1))" R XXX"(((!((i1.u2.next_2==1)&&(i9.u54.ncs_7_4==1)))&&(i2.u5.next_11==1))&&(i2.u4.ncs_1...164
Compilation finished in 2177 ms.
Running link step : cd /tmp/ltsmin6015568255040542878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6015568255040542878;'/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' '--ltl' '[](([](!(LTLAPp0==true)) U X(X(X(!(LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t15, t16, t17, t18, t19, t20, t21, t50, t60, t61, t62, t93, t94, t96, t105, t107, t110, t...1709
Detected timeout of ITS tools.
[2025-05-29 19:01:54] [INFO ] Applying decomposition
[2025-05-29 19:01:54] [INFO ] Flatten gal took : 55 ms
[2025-05-29 19:01:54] [INFO ] Decomposing Gal with order
[2025-05-29 19:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:01:55] [INFO ] Removed a total of 923 redundant transitions.
[2025-05-29 19:01:55] [INFO ] Flatten gal took : 217 ms
[2025-05-29 19:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 39 ms.
[2025-05-29 19:01:55] [INFO ] Time to serialize gal into /tmp/LTLFireability15133307243109059577.gal : 4 ms
[2025-05-29 19:01:55] [INFO ] Time to serialize properties into /tmp/LTLFireability16386067966256429066.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15133307243109059577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16386067966256429066.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((G(!("((u9.next_2==1)&&(u4.ncs_7_4==1))")))U(X(X(X(!("(((!((u9.next_2==1)&&(u4.ncs_7_4==1)))&&(u9.next_11==1))&&(u6.ncs_1_4==1))"...163
Formula 0 simplified : F(F"((u9.next_2==1)&&(u4.ncs_7_4==1))" R XXX"(((!((u9.next_2==1)&&(u4.ncs_7_4==1)))&&(u9.next_11==1))&&(u6.ncs_1_4==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t6, t7, t17, t19, t23, t32, t33, t38, t52, t64, t65, t66, t76, t107, t108, t109, ...970
13 unique states visited
7 strongly connected components in search stack
14 transitions explored
7 items max in DFS search stack
14859 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,148.643,2537128,1,0,3.85111e+06,434891,2567,4.98175e+06,1481,2.96547e+06,639613
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Anderson-PT-08-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2096779 ms.

BK_STOP 1748545653259

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="Anderson-PT-08"
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 Anderson-PT-08, 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 r002-tall-174853728800180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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