Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K 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 58K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 65K 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 185K 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-05-LTLFireability-00
FORMULA_NAME Anderson-PT-05-LTLFireability-01
FORMULA_NAME Anderson-PT-05-LTLFireability-02
FORMULA_NAME Anderson-PT-05-LTLFireability-03
FORMULA_NAME Anderson-PT-05-LTLFireability-04
FORMULA_NAME Anderson-PT-05-LTLFireability-05
FORMULA_NAME Anderson-PT-05-LTLFireability-06
FORMULA_NAME Anderson-PT-05-LTLFireability-07
FORMULA_NAME Anderson-PT-05-LTLFireability-08
FORMULA_NAME Anderson-PT-05-LTLFireability-09
FORMULA_NAME Anderson-PT-05-LTLFireability-10
FORMULA_NAME Anderson-PT-05-LTLFireability-11
FORMULA_NAME Anderson-PT-05-LTLFireability-12
FORMULA_NAME Anderson-PT-05-LTLFireability-13
FORMULA_NAME Anderson-PT-05-LTLFireability-14
FORMULA_NAME Anderson-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748541422042

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 17:57:03] [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 17:57:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:57:03] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-05-29 17:57:03] [INFO ] Transformed 161 places.
[2025-05-29 17:57:03] [INFO ] Transformed 365 transitions.
[2025-05-29 17:57:03] [INFO ] Found NUPN structural information;
[2025-05-29 17:57:03] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 141 transition count 297
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 141 transition count 297
Applied a total of 40 rules in 27 ms. Remains 141 /161 variables (removed 20) and now considering 297/365 (removed 68) transitions.
// Phase 1: matrix 297 rows 141 cols
[2025-05-29 17:57:03] [INFO ] Computed 13 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:57:04] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-05-29 17:57:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:57:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 17:57:04] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2025-05-29 17:57:04] [INFO ] Invariant cache hit.
[2025-05-29 17:57:04] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:06] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:06] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:06] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:06] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:07] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:08] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:08] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:08] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:08] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:08] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:09] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:09] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:09] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:10] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:10] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:11] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:12] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:13] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:13] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:13] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 297/438 variables, 141/181 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:18] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:18] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:22] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:24] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:24] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:26] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:27] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:33] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 13 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/438 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 209 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:43] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:43] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:57:43] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
SMT process timed out in 60298ms, After SMT, problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Starting structural reductions in LTL mode, iteration 1 : 141/161 places, 297/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61086 ms. Remains : 141/161 places, 297/365 transitions.
Support contains 47 out of 141 places after structural reductions.
[2025-05-29 17:58:04] [INFO ] Flatten gal took : 47 ms
[2025-05-29 17:58:04] [INFO ] Flatten gal took : 22 ms
[2025-05-29 17:58:05] [INFO ] Input system was already deterministic with 297 transitions.
Reduction of identical properties reduced properties to check from 40 to 39
RANDOM walk for 40000 steps (8 resets) in 2738 ms. (14 steps per ms) remains 11/39 properties
BEST_FIRST walk for 40001 steps (8 resets) in 282 ms. (141 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/2 properties
[2025-05-29 17:58:06] [INFO ] Invariant cache hit.
[2025-05-29 17:58:06] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
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) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/131 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 297/438 variables, 141/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/438 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 20/20 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) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/131 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 297/438 variables, 141/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/438 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 42 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 102/141 places, 154/297 transitions.
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 5695 steps (0 resets) in 29 ms. (189 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
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 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 141 transition count 278
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 122 transition count 278
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 58 place count 102 transition count 146
Iterating global reduction 0 with 20 rules applied. Total rules applied 78 place count 102 transition count 146
Applied a total of 78 rules in 17 ms. Remains 102 /141 variables (removed 39) and now considering 146/297 (removed 151) transitions.
// Phase 1: matrix 146 rows 102 cols
[2025-05-29 17:58:07] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:58:07] [INFO ] Implicit Places using invariants in 126 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 146/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 101 transition count 131
Reduce places removed 15 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 20 rules applied. Total rules applied 35 place count 86 transition count 126
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 40 place count 81 transition count 126
Applied a total of 40 rules in 10 ms. Remains 81 /101 variables (removed 20) and now considering 126/146 (removed 20) transitions.
// Phase 1: matrix 126 rows 81 cols
[2025-05-29 17:58:07] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:58:07] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-29 17:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:58:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 17:58:07] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/141 places, 126/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 379 ms. Remains : 81/141 places, 126/297 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 207 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-00 finished in 806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||G(!p1)||(!p1&&F(G(!p2))))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 174
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 174
Applied a total of 38 rules in 10 ms. Remains 122 /141 variables (removed 19) and now considering 174/297 (removed 123) transitions.
// Phase 1: matrix 174 rows 122 cols
[2025-05-29 17:58:07] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:58:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-05-29 17:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:58:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 17:58:08] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-05-29 17:58:08] [INFO ] Invariant cache hit.
[2025-05-29 17:58:08] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:08] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:09] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:09] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:09] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:09] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:09] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:10] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:10] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:10] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 174/296 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:13] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/296 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 165 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8374 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 174/296 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 169/334 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/296 variables, and 334 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38431ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 38432ms
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 174/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38810 ms. Remains : 122/141 places, 174/297 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 19972 reset in 155 ms.
Product exploration explored 100000 steps with 20001 reset in 146 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 p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/7 properties
BEST_FIRST walk for 6743 steps (1 resets) in 10 ms. (613 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-05-29 17:58:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:58:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-29 17:58:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:58:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 17:58:49] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-05-29 17:58:49] [INFO ] Invariant cache hit.
[2025-05-29 17:58:49] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:49] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:50] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:50] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:50] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:50] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:50] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:51] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:51] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 174/296 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:58:54] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/296 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 165 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 174/296 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 169/334 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/296 variables, and 334 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38254ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 38256ms
Finished structural reductions in LTL mode , in 1 iterations and 38597 ms. Remains : 122/122 places, 174/174 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 p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 154 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/7 properties
BEST_FIRST walk for 5349 steps (0 resets) in 7 ms. (668 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F p2), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
Product exploration explored 100000 steps with 20090 reset in 124 ms.
Product exploration explored 100000 steps with 20054 reset in 122 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (NOT p0), true, (AND p1 (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p2 p1 p0)]
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 174/174 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 122 transition count 174
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 122 transition count 174
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 19 rules in 14 ms. Remains 122 /122 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 17:59:30] [INFO ] Redundant transitions in 5 ms returned []
Running 169 sub problems to find dead transitions.
// Phase 1: matrix 174 rows 122 cols
[2025-05-29 17:59:30] [INFO ] Computed 13 invariants in 2 ms
[2025-05-29 17:59:30] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [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 17:59:31] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:31] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:32] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:32] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 12/25 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/25 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 174/296 variables, 122/147 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 34/181 constraints. Problems are: Problem set: 19 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:33] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:59:33] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/183 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/183 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/296 variables, 0/183 constraints. Problems are: Problem set: 19 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 183 constraints, problems are : Problem set: 19 solved, 150 unsolved in 6850 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 14/16 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 19/122 variables, 6/22 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/27 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/27 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 174/296 variables, 122/149 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 34/183 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 150/333 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/333 constraints. Problems are: Problem set: 19 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/296 variables, 0/333 constraints. Problems are: Problem set: 19 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 333 constraints, problems are : Problem set: 19 solved, 150 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 150/169 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36897ms problems are : Problem set: 19 solved, 150 unsolved
Search for dead transitions found 19 dead transitions in 36899ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/122 places, 155/174 transitions.
Graph (complete) has 420 edges and 122 vertex of which 103 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 103 /122 variables (removed 19) and now considering 155/155 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/122 places, 155/174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36949 ms. Remains : 103/122 places, 155/174 transitions.
Built C files in :
/tmp/ltsmin8131881779487103607
[2025-05-29 18:00:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8131881779487103607
Running compilation step : cd /tmp/ltsmin8131881779487103607;'/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 654 ms.
Running link step : cd /tmp/ltsmin8131881779487103607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8131881779487103607;'/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/stateBased5557724967800372918.hoa' '--buchi-type=spotba'
LTSmin run took 441 ms.
FORMULA Anderson-PT-05-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-05-LTLFireability-01 finished in 120336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)&&X(G(p1))) U X(X(p2))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 184
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 184
Applied a total of 34 rules in 3 ms. Remains 124 /141 variables (removed 17) and now considering 184/297 (removed 113) transitions.
// Phase 1: matrix 184 rows 124 cols
[2025-05-29 18:00:08] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:08] [INFO ] Implicit Places using invariants in 165 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 184/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 123/141 places, 184/297 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p1), p0]
Running random walk in product with property : Anderson-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-02 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((!p0&&(!p0 U (!p1||G(!p0)))))) U p2)))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 2 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2025-05-29 18:00:08] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:08] [INFO ] Implicit Places using invariants in 110 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), p0, (AND p0 p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 2 reset in 109 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-03 finished in 383 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((p1||G(p2)))||p0)))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 13 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2025-05-29 18:00:09] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:09] [INFO ] Implicit Places using invariants in 153 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 101 transition count 140
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 87 transition count 135
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 82 transition count 135
Applied a total of 38 rules in 5 ms. Remains 82 /101 variables (removed 19) and now considering 135/154 (removed 19) transitions.
// Phase 1: matrix 135 rows 82 cols
[2025-05-29 18:00:09] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:09] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-29 18:00:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:00:09] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/141 places, 135/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 488 ms. Remains : 82/141 places, 135/297 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 159 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 p2 p1 p0), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 140 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/3 properties
[2025-05-29 18:00:10] [INFO ] Invariant cache hit.
[2025-05-29 18:00:10] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/217 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/82 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p0 p1)))
Knowledge based reduction with 18 factoid took 246 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-04 finished in 1578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 9 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2025-05-29 18:00:10] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:10] [INFO ] Implicit Places using invariants in 158 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 6 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2025-05-29 18:00:10] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:11] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-29 18:00:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:00:11] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/141 places, 130/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 408 ms. Remains : 77/141 places, 130/297 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-05
Product exploration explored 100000 steps with 18 reset in 121 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-05 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!(p0 U p1)||!(p2 U X(X(p0)))))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 2 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2025-05-29 18:00:11] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:11] [INFO ] Implicit Places using invariants in 164 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 0 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND p0 p1), (AND p0 p1), p0, (AND p0 (NOT p1)), (AND p1 p0), p0, true, (AND p1 p0), (AND p1 (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 145 reset in 114 ms.
Product exploration explored 100000 steps with 156 reset in 140 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 p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 194 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND p0 p1), (AND p0 p1), p0, (AND p0 (NOT p1)), (AND p1 p0), p0, true, (AND p1 p0), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
// Phase 1: matrix 183 rows 122 cols
[2025-05-29 18:00:12] [INFO ] Computed 12 invariants in 2 ms
[2025-05-29 18:00:12] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/115 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/117 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 122/305 variables, and 12 constraints, problems are : Problem set: 2 solved, 0 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/122 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 14 factoid took 348 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), p0, (AND (NOT p1) p0), (AND p1 p0), p0, true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 278 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), p0, (AND (NOT p1) p0), (AND p1 p0), p0, true, (AND p0 p1), p1]
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 183/183 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2025-05-29 18:00:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-29 18:00:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:00:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:00:14] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-05-29 18:00:14] [INFO ] Invariant cache hit.
[2025-05-29 18:00:14] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:15] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:15] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:15] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:15] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:16] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:16] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:17] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 183/305 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:21] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:21] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 10 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/305 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:23] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 10 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/305 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 0/305 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 164 constraints, problems are : Problem set: 0 solved, 178 unsolved in 13158 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 183/305 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 178/342 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 342 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43229ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 43230ms
Finished structural reductions in LTL mode , in 1 iterations and 43603 ms. Remains : 122/122 places, 183/183 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 p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), p0, (AND (NOT p1) p0), (AND p1 p0), p0, true, (AND p0 p1), p1]
RANDOM walk for 20477 steps (4 resets) in 59 ms. (341 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 212 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), p0, (AND (NOT p1) p0), (AND p1 p0), p0, true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 277 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), p0, (AND (NOT p1) p0), (AND p1 p0), p0, true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), p0, (AND (NOT p1) p0), (AND p1 p0), p0, true, (AND p0 p1), p1]
Product exploration explored 100000 steps with 149 reset in 100 ms.
Product exploration explored 100000 steps with 129 reset in 109 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 274 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), p0, (AND (NOT p1) p0), (AND p1 p0), p0, true, (AND p0 p1), p1]
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 183/183 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 122 transition count 183
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 18 place count 122 transition count 183
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 38 place count 122 transition count 183
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 38 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:00:59] [INFO ] Redundant transitions in 5 ms returned []
Running 178 sub problems to find dead transitions.
// Phase 1: matrix 183 rows 122 cols
[2025-05-29 18:00:59] [INFO ] Computed 12 invariants in 1 ms
[2025-05-29 18:00:59] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:00] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:01] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 10/22 constraints. Problems are: Problem set: 38 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:01] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:01] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:01] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 3/25 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/25 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 183/305 variables, 122/147 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 35/182 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/182 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/182 constraints. Problems are: Problem set: 38 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 182 constraints, problems are : Problem set: 38 solved, 140 unsolved in 5683 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 38 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 13/13 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 38/122 variables, 8/21 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 4/25 constraints. Problems are: Problem set: 38 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:06] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/26 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/26 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 183/305 variables, 122/148 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 35/183 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 140/323 constraints. Problems are: Problem set: 38 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/323 constraints. Problems are: Problem set: 38 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 323 constraints, problems are : Problem set: 38 solved, 140 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 140/178 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35718ms problems are : Problem set: 38 solved, 140 unsolved
Search for dead transitions found 38 dead transitions in 35719ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/122 places, 145/183 transitions.
Graph (complete) has 378 edges and 122 vertex of which 84 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 84 /122 variables (removed 38) and now considering 145/145 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/122 places, 145/183 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35761 ms. Remains : 84/122 places, 145/183 transitions.
Built C files in :
/tmp/ltsmin10906845374189817191
[2025-05-29 18:01:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10906845374189817191
Running compilation step : cd /tmp/ltsmin10906845374189817191;'/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 275 ms.
Running link step : cd /tmp/ltsmin10906845374189817191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10906845374189817191;'/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/stateBased14139904883199671429.hoa' '--buchi-type=spotba'
LTSmin run took 2429 ms.
FORMULA Anderson-PT-05-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-05-LTLFireability-06 finished in 86859 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((G(F((p0 U (G(p0)||(p0&&G(p1))))))||(!p0&&F((p0 U (G(p0)||(p0&&G(p1)))))))))||(F(p2)&&F((G(F((p0 U (G(p0)||(p0&&G(p1))))))||(!p0&&F((p0 U (G(p0)||(p0&&G(p1))))))))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 176
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 176
Applied a total of 34 rules in 4 ms. Remains 124 /141 variables (removed 17) and now considering 176/297 (removed 121) transitions.
// Phase 1: matrix 176 rows 124 cols
[2025-05-29 18:01:38] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:38] [INFO ] Implicit Places using invariants in 94 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 176/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 123/141 places, 176/297 transitions.
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 15780 steps with 0 reset with depth 15781 and stack size 5747 in 18 ms.
FORMULA Anderson-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-07 finished in 622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1 U p2))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 13 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2025-05-29 18:01:38] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:38] [INFO ] Implicit Places using invariants in 90 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 3 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2025-05-29 18:01:38] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-29 18:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:01:39] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/141 places, 130/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 319 ms. Remains : 77/141 places, 130/297 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 91 reset in 90 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-08 finished in 466 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(((X(p0)&&(!p0||G((F(!p1)||X(!p2)))))||G(p0)))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 5 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2025-05-29 18:01:39] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:39] [INFO ] Implicit Places using invariants in 96 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 0 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1 p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 73 reset in 99 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-09 finished in 570 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(p1) U p2)||p1)))&&p0)))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 121 transition count 165
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 121 transition count 165
Applied a total of 40 rules in 4 ms. Remains 121 /141 variables (removed 20) and now considering 165/297 (removed 132) transitions.
// Phase 1: matrix 165 rows 121 cols
[2025-05-29 18:01:39] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:40] [INFO ] Implicit Places using invariants in 123 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/141 places, 165/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 120/141 places, 165/297 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : Anderson-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-10 finished in 342 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 U (p1||G(p0))))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 141 transition count 279
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 123 transition count 279
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 55 place count 104 transition count 148
Iterating global reduction 0 with 19 rules applied. Total rules applied 74 place count 104 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 103 transition count 147
Applied a total of 76 rules in 15 ms. Remains 103 /141 variables (removed 38) and now considering 147/297 (removed 150) transitions.
// Phase 1: matrix 147 rows 103 cols
[2025-05-29 18:01:40] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:40] [INFO ] Implicit Places using invariants in 89 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/141 places, 147/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 102 transition count 132
Reduce places removed 15 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 20 rules applied. Total rules applied 35 place count 87 transition count 127
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 40 place count 82 transition count 127
Applied a total of 40 rules in 3 ms. Remains 82 /102 variables (removed 20) and now considering 127/147 (removed 20) transitions.
// Phase 1: matrix 127 rows 82 cols
[2025-05-29 18:01:40] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:40] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-29 18:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:01:40] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/141 places, 127/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 82/141 places, 127/297 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 116 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-11 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 12 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2025-05-29 18:01:40] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:40] [INFO ] Implicit Places using invariants in 116 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 3 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2025-05-29 18:01:40] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-29 18:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:01:41] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/141 places, 130/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 323 ms. Remains : 77/141 places, 130/297 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-12
Product exploration explored 100000 steps with 16 reset in 88 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-12 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 5 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2025-05-29 18:01:41] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:41] [INFO ] Implicit Places using invariants in 124 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 4 reset in 117 ms.
Product exploration explored 100000 steps with 2 reset in 132 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 p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 90 ms. (439 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 183/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
// Phase 1: matrix 183 rows 122 cols
[2025-05-29 18:01:42] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-29 18:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:01:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:01:42] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-05-29 18:01:42] [INFO ] Invariant cache hit.
[2025-05-29 18:01:42] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:43] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:43] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:43] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:43] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:44] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:44] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:44] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 183/305 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:47] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/305 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 162 constraints, problems are : Problem set: 0 solved, 178 unsolved in 8618 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:01:52] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 183/305 variables, 122/143 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 178/341 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 1)
(t3 1)
(t4 4)
(t5 0)
(t6 1)
(t7 3)
(t8 1)
(t9 0)
(t10 1)
(t11 6)
(t12 0)
(t13 0)
(t14 1)
(t15 1)
(t16 0)
(t17 2)
(t18 0)
(t19 1)
(t20 1)
(t21 1)
(t22 2)
(t23 0)
(t24 0)
(t25 0)
(t26 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 341 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38663ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 38663ms
Finished structural reductions in LTL mode , in 1 iterations and 38988 ms. Remains : 122/122 places, 183/183 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 (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Entered a terminal (fully accepting) state of product in 98342 steps with 2 reset in 101 ms.
FORMULA Anderson-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-13 finished in 41073 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)||(G(p2)&&p1))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 2 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2025-05-29 18:02:22] [INFO ] Computed 13 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:02:22] [INFO ] Implicit Places using invariants in 103 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 113 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 p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-14 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p1 U p2)||p0)))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 176
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 176
Applied a total of 34 rules in 3 ms. Remains 124 /141 variables (removed 17) and now considering 176/297 (removed 121) transitions.
// Phase 1: matrix 176 rows 124 cols
[2025-05-29 18:02:22] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:02:22] [INFO ] Implicit Places using invariants in 93 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 176/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 123/141 places, 176/297 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 428 reset in 98 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-15 finished in 328 ms.
All properties solved by simple procedures.
Total runtime 319878 ms.

BK_STOP 1748541743197

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-05"
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-05, 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-174853728700156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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