Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734899000300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FireWire-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-17-LTLFireability-00
FORMULA_NAME FireWire-PT-17-LTLFireability-01
FORMULA_NAME FireWire-PT-17-LTLFireability-02
FORMULA_NAME FireWire-PT-17-LTLFireability-03
FORMULA_NAME FireWire-PT-17-LTLFireability-04
FORMULA_NAME FireWire-PT-17-LTLFireability-05
FORMULA_NAME FireWire-PT-17-LTLFireability-06
FORMULA_NAME FireWire-PT-17-LTLFireability-07
FORMULA_NAME FireWire-PT-17-LTLFireability-08
FORMULA_NAME FireWire-PT-17-LTLFireability-09
FORMULA_NAME FireWire-PT-17-LTLFireability-10
FORMULA_NAME FireWire-PT-17-LTLFireability-11
FORMULA_NAME FireWire-PT-17-LTLFireability-12
FORMULA_NAME FireWire-PT-17-LTLFireability-13
FORMULA_NAME FireWire-PT-17-LTLFireability-14
FORMULA_NAME FireWire-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368826225

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 22:53:47] [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]
[2024-06-02 22:53:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:53:47] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 22:53:47] [INFO ] Transformed 428 places.
[2024-06-02 22:53:47] [INFO ] Transformed 656 transitions.
[2024-06-02 22:53:47] [INFO ] Found NUPN structural information;
[2024-06-02 22:53:47] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 422 transition count 656
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 94 place count 334 transition count 568
Iterating global reduction 1 with 88 rules applied. Total rules applied 182 place count 334 transition count 568
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 204 place count 312 transition count 538
Iterating global reduction 1 with 22 rules applied. Total rules applied 226 place count 312 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 228 place count 312 transition count 536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 310 transition count 534
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 310 transition count 534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 233 place count 309 transition count 533
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 309 transition count 533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 308 transition count 532
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 308 transition count 532
Applied a total of 236 rules in 92 ms. Remains 308 /428 variables (removed 120) and now considering 532/656 (removed 124) transitions.
// Phase 1: matrix 532 rows 308 cols
[2024-06-02 22:53:47] [INFO ] Computed 7 invariants in 21 ms
[2024-06-02 22:53:48] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-02 22:53:48] [INFO ] Invariant cache hit.
[2024-06-02 22:53:48] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 531 sub problems to find dead transitions.
[2024-06-02 22:53:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 21 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 150 places in 158 ms of which 4 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 1 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 2 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 4 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 166 places in 117 ms of which 9 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 1 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:53:57] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:53:59] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:00] [INFO ] Deduced a trap composed of 87 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:06] [INFO ] Deduced a trap composed of 157 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:54:07] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:10] [INFO ] Deduced a trap composed of 150 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:54:11] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:54:11] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:15] [INFO ] Deduced a trap composed of 158 places in 94 ms of which 1 ms to minimize.
[2024-06-02 22:54:15] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:54:16] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/840 variables, and 29 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:22] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:25] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:54:27] [INFO ] Deduced a trap composed of 161 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:30] [INFO ] Deduced a trap composed of 157 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 7 (OVERLAPS) 532/840 variables, 308/341 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 531/872 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 22:54:42] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:54:42] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:54:42] [INFO ] Deduced a trap composed of 111 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 875 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 29/29 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 308/428 places, 532/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61045 ms. Remains : 308/428 places, 532/656 transitions.
Support contains 54 out of 308 places after structural reductions.
[2024-06-02 22:54:49] [INFO ] Flatten gal took : 65 ms
[2024-06-02 22:54:49] [INFO ] Flatten gal took : 42 ms
[2024-06-02 22:54:49] [INFO ] Input system was already deterministic with 532 transitions.
Support contains 49 out of 308 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 1295 ms. (30 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
[2024-06-02 22:54:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 219/257 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 12/269 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 491/760 variables, 269/276 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 17/777 variables, 8/284 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 20/797 variables, 9/293 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/797 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 14/811 variables, 7/300 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/811 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 17/828 variables, 7/307 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/828 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 11/839 variables, 7/314 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 1/840 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/840 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 0/840 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 315 constraints, problems are : Problem set: 1 solved, 24 unsolved in 2795 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 220/257 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-02 22:54:52] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:54:53] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:54:53] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:54:53] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 12/269 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 491/760 variables, 269/280 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 23/303 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-02 22:54:54] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:54:54] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 2/305 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 17/777 variables, 8/313 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/777 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 20/797 variables, 9/323 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-02 22:54:56] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 1/324 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/797 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 14/811 variables, 7/331 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/840 variables, and 331 constraints, problems are : Problem set: 1 solved, 24 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 293/308 constraints, PredecessorRefiner: 24/25 constraints, Known Traps: 7/7 constraints]
After SMT, in 7831ms problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 204 edges and 308 vertex of which 15 / 308 are part of one of the 3 SCC in 5 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 296 transition count 468
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 99 place count 249 transition count 464
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 247 transition count 462
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 245 transition count 462
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 105 place count 245 transition count 434
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 161 place count 217 transition count 434
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 219 place count 188 transition count 405
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 259 place count 168 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 263 place count 168 transition count 500
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 283 place count 168 transition count 480
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 303 place count 148 transition count 480
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 304 place count 148 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 305 place count 147 transition count 479
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 308 place count 147 transition count 479
Applied a total of 308 rules in 110 ms. Remains 147 /308 variables (removed 161) and now considering 479/532 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 147/308 places, 479/532 transitions.
RANDOM walk for 40000 steps (1662 resets) in 607 ms. (65 steps per ms) remains 12/24 properties
BEST_FIRST walk for 40003 steps (427 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (444 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (220 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (544 resets) in 119 ms. (333 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (438 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (441 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (534 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (441 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (150 resets) in 88 ms. (449 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (327 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
[2024-06-02 22:54:58] [INFO ] Flow matrix only has 464 transitions (discarded 15 similar events)
// Phase 1: matrix 464 rows 147 cols
[2024-06-02 22:54:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:54:58] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 123/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/143 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 464/607 variables, 143/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 14/164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/611 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/611 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 168 constraints, problems are : Problem set: 0 solved, 8 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 123/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:54:59] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:54:59] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:54:59] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/143 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 464/607 variables, 143/153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 14/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:54:59] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/611 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/611 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/611 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/611 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 611/611 variables, and 180 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 1457ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 5421 ms.
Support contains 16 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 479/479 transitions.
Graph (trivial) has 36 edges and 147 vertex of which 2 / 147 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 146 transition count 474
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 143 transition count 474
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 143 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 142 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 142 transition count 432
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 139 transition count 429
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 139 transition count 428
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 138 transition count 426
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 138 transition count 426
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 24 place count 138 transition count 421
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 38 place count 131 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 3 with 51 rules applied. Total rules applied 89 place count 131 transition count 403
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 131 transition count 399
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 97 place count 127 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 4 with 43 rules applied. Total rules applied 140 place count 127 transition count 356
Applied a total of 140 rules in 54 ms. Remains 127 /147 variables (removed 20) and now considering 356/479 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 127/147 places, 356/479 transitions.
RANDOM walk for 40000 steps (1920 resets) in 712 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (493 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (491 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (495 resets) in 36 ms. (1081 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (494 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (557 resets) in 36 ms. (1081 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (211 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (384 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 615774 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :4 out of 8
Probabilistic random walk after 615774 steps, saw 181024 distinct states, run finished after 3005 ms. (steps per millisecond=204 ) properties seen :4
[2024-06-02 22:55:08] [INFO ] Flow matrix only has 341 transitions (discarded 15 similar events)
// Phase 1: matrix 341 rows 127 cols
[2024-06-02 22:55:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:55:08] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/123 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:55:08] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 341/464 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/468 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/468 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:55:09] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 53/123 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:55:09] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 341/464 variables, 123/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/468 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/468 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 738ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1841 ms.
Support contains 8 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 356/356 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 127 transition count 355
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 2 place count 126 transition count 355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 125 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 125 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 123 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 320
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 1 with 2 rules applied. Total rules applied 13 place count 121 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 121 transition count 318
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 121 transition count 316
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 26 place count 119 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 39 place count 119 transition count 297
Applied a total of 39 rules in 35 ms. Remains 119 /127 variables (removed 8) and now considering 297/356 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 119/127 places, 297/356 transitions.
RANDOM walk for 40000 steps (2133 resets) in 117 ms. (338 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (546 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (545 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (233 resets) in 56 ms. (701 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (420 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2024-06-02 22:55:11] [INFO ] Flow matrix only has 263 transitions (discarded 34 similar events)
// Phase 1: matrix 263 rows 119 cols
[2024-06-02 22:55:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:55:11] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 61/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:55:11] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 48/115 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 263/378 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/382 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/382 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 61/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 48/115 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 263/378 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/382 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/382 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 420ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 192 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 119/119 places, 297/297 transitions.
RANDOM walk for 40000 steps (2137 resets) in 94 ms. (421 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (552 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (551 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
[2024-06-02 22:55:12] [INFO ] Flow matrix only has 263 transitions (discarded 34 similar events)
[2024-06-02 22:55:12] [INFO ] Invariant cache hit.
[2024-06-02 22:55:12] [INFO ] State equation strengthened by 42 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/115 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/378 variables, 115/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 42/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/382 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/115 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/378 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/382 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/382 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 297/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 119 transition count 296
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 2 place count 118 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 116 transition count 296
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 116 transition count 296
Applied a total of 7 rules in 23 ms. Remains 116 /119 variables (removed 3) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 116/119 places, 296/297 transitions.
RANDOM walk for 40000 steps (2171 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (605 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (579 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 73954 steps, run visited all 2 properties in 166 ms. (steps per millisecond=445 )
Probabilistic random walk after 73954 steps, saw 28534 distinct states, run finished after 169 ms. (steps per millisecond=437 ) properties seen :2
FORMULA FireWire-PT-17-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-17-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA FireWire-PT-17-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 47 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1) U (F(!p0)&&G(!p2)))))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 9 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 22:55:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:55:13] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:55:13] [INFO ] Invariant cache hit.
[2024-06-02 22:55:13] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 22:55:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:55:18] [INFO ] Deduced a trap composed of 182 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:55:18] [INFO ] Deduced a trap composed of 154 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:55:18] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:55:18] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2024-06-02 22:55:18] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:55:19] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 4 ms to minimize.
[2024-06-02 22:55:19] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:55:19] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:55:19] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:55:20] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:55:20] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:55:20] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 6 ms to minimize.
[2024-06-02 22:55:20] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 1 ms to minimize.
[2024-06-02 22:55:20] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:55:21] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:55:23] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:55:24] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:55:54] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:55:56] [INFO ] Deduced a trap composed of 115 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60561 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 491 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Running random walk in product with property : FireWire-PT-17-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 1 reset in 117 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 131 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (13 resets) in 268 ms. (148 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40000 steps (25 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (13 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (19 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (15 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (18 resets) in 271 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (17 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
[2024-06-02 22:56:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 206/211 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 22:56:16] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 303 constraints, problems are : Problem set: 2 solved, 5 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 206/211 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 5/274 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 0/274 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 18/742 variables, 8/282 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/762 variables, 10/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/774 variables, 6/298 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/774 variables, 0/298 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 14/788 variables, 6/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/788 variables, 0/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/794 variables, 4/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/794 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/794 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 308 constraints, problems are : Problem set: 2 solved, 5 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1968ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 946 ms.
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 225 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 280 transition count 429
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 229 transition count 425
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 105 place count 229 transition count 393
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 169 place count 197 transition count 393
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 225 place count 169 transition count 365
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 283 place count 140 transition count 491
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 289 place count 140 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 344 place count 140 transition count 430
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 364 place count 140 transition count 410
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 390 place count 120 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 445 place count 120 transition count 349
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 448 place count 120 transition count 349
Applied a total of 448 rules in 40 ms. Remains 120 /295 variables (removed 175) and now considering 349/499 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 120/295 places, 349/499 transitions.
RANDOM walk for 40000 steps (1931 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (652 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (16 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (507 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 88536 steps, run visited all 5 properties in 517 ms. (steps per millisecond=171 )
Probabilistic random walk after 88536 steps, saw 33456 distinct states, run finished after 517 ms. (steps per millisecond=171 ) properties seen :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p1))), (G (AND (OR (NOT p1) (NOT p2)) (OR (NOT p2) (NOT p0)))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (OR (NOT p1) p2) (OR p2 (NOT p0))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 12 factoid took 548 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 180 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 295 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 3 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 22:56:20] [INFO ] Invariant cache hit.
[2024-06-02 22:56:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 22:56:20] [INFO ] Invariant cache hit.
[2024-06-02 22:56:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 22:56:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:56:25] [INFO ] Deduced a trap composed of 182 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:56:25] [INFO ] Deduced a trap composed of 154 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:56:25] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:56:26] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:56:26] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:56:26] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:56:26] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:56:26] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:56:26] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:56:27] [INFO ] Deduced a trap composed of 85 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:56:27] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:56:27] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:56:27] [INFO ] Deduced a trap composed of 114 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:56:27] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:56:28] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:56:30] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:56:31] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:57:01] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:57:03] [INFO ] Deduced a trap composed of 115 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 295/295 places, 499/499 transitions.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
RANDOM walk for 40000 steps (11 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (14 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (15 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (15 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 858973 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 3
Probabilistic random walk after 858973 steps, saw 168001 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :0
[2024-06-02 22:57:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 207/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:57:24] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 207/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/742 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/762 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/774 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/774 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/788 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/788 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/794 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/794 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/794 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 306 constraints, problems are : Problem set: 0 solved, 3 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1311ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 359 ms.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 229 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 280 transition count 429
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 229 transition count 425
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 105 place count 229 transition count 392
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 171 place count 196 transition count 392
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 227 place count 168 transition count 364
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 285 place count 139 transition count 490
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 291 place count 139 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 346 place count 139 transition count 429
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 367 place count 139 transition count 408
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 394 place count 118 transition count 402
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 449 place count 118 transition count 347
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 451 place count 118 transition count 347
Applied a total of 451 rules in 47 ms. Remains 118 /295 variables (removed 177) and now considering 347/499 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 118/295 places, 347/499 transitions.
RANDOM walk for 40000 steps (2120 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (13 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (695 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 14747 steps, run visited all 3 properties in 92 ms. (steps per millisecond=160 )
Probabilistic random walk after 14747 steps, saw 5533 distinct states, run finished after 92 ms. (steps per millisecond=160 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F p0), (F p2)]
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 162 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 175 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Product exploration explored 100000 steps with 1 reset in 125 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 229 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 280 transition count 483
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 280 transition count 481
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 50 place count 280 transition count 501
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 280 transition count 501
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 83 place count 265 transition count 486
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 98 place count 265 transition count 486
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 136 place count 265 transition count 488
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 156 place count 245 transition count 468
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 176 place count 245 transition count 468
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 213 place count 245 transition count 709
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 223 place count 235 transition count 687
Deduced a syphon composed of 95 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 233 place count 235 transition count 687
Deduced a syphon composed of 95 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 2 with 55 rules applied. Total rules applied 288 place count 235 transition count 632
Deduced a syphon composed of 95 places in 0 ms
Applied a total of 288 rules in 79 ms. Remains 235 /295 variables (removed 60) and now considering 632/499 (removed -133) transitions.
[2024-06-02 22:57:28] [INFO ] Redundant transitions in 58 ms returned []
Running 623 sub problems to find dead transitions.
[2024-06-02 22:57:28] [INFO ] Flow matrix only has 612 transitions (discarded 20 similar events)
// Phase 1: matrix 612 rows 235 cols
[2024-06-02 22:57:28] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:57:28] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 623 unsolved
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-06-02 22:57:33] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:57:34] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-02 22:57:34] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-02 22:57:34] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
[2024-06-02 22:57:34] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
[2024-06-02 22:57:34] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 16/23 constraints. Problems are: Problem set: 188 solved, 435 unsolved
[2024-06-02 22:57:37] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-06-02 22:57:37] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:57:38] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 3/26 constraints. Problems are: Problem set: 188 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/26 constraints. Problems are: Problem set: 188 solved, 435 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
At refinement iteration 5 (OVERLAPS) 611/846 variables, 235/261 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 52/313 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 0/313 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 1/847 variables, 1/314 constraints. Problems are: Problem set: 200 solved, 423 unsolved
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 2/316 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/847 variables, 0/316 constraints. Problems are: Problem set: 200 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/847 variables, and 316 constraints, problems are : Problem set: 200 solved, 423 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 235/235 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 200 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 90/229 variables, 7/7 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 21/28 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/28 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 607/836 variables, 229/257 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 52/309 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 423/732 constraints. Problems are: Problem set: 200 solved, 423 unsolved
[2024-06-02 22:58:06] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 1/733 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 0/733 constraints. Problems are: Problem set: 200 solved, 423 unsolved
SMT process timed out in 60451ms, After SMT, problems are : Problem set: 200 solved, 423 unsolved
Search for dead transitions found 200 dead transitions in 60460ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) removed 200 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 235/295 places, 432/499 transitions.
Graph (complete) has 745 edges and 235 vertex of which 140 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.5 ms
Discarding 95 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 140 /235 variables (removed 95) and now considering 432/432 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 140/295 places, 432/499 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60620 ms. Remains : 140/295 places, 432/499 transitions.
Built C files in :
/tmp/ltsmin7771411946019204311
[2024-06-02 22:58:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7771411946019204311
Running compilation step : cd /tmp/ltsmin7771411946019204311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 995 ms.
Running link step : cd /tmp/ltsmin7771411946019204311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7771411946019204311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15718766232072547058.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 3 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 22:58:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:58:43] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:58:43] [INFO ] Invariant cache hit.
[2024-06-02 22:58:43] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 22:58:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:58:48] [INFO ] Deduced a trap composed of 182 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:58:48] [INFO ] Deduced a trap composed of 154 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:58:48] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:58:48] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:58:49] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:58:49] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-06-02 22:58:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:58:49] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:58:49] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 114 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:58:51] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:58:53] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:58:54] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 22:59:24] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:59:26] [INFO ] Deduced a trap composed of 115 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in LTL mode , in 1 iterations and 60502 ms. Remains : 295/295 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin17875423116515285209
[2024-06-02 22:59:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17875423116515285209
Running compilation step : cd /tmp/ltsmin17875423116515285209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 832 ms.
Running link step : cd /tmp/ltsmin17875423116515285209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17875423116515285209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4640612416869629873.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:59:59] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:59:59] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:59:59] [INFO ] Time to serialize gal into /tmp/LTL9408418225418476047.gal : 6 ms
[2024-06-02 22:59:59] [INFO ] Time to serialize properties into /tmp/LTL708030728490074403.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9408418225418476047.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6961022180041692972.hoa' '-atoms' '/tmp/LTL708030728490074403.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL708030728490074403.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6961022180041692972.hoa
Detected timeout of ITS tools.
[2024-06-02 23:00:14] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:00:14] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:00:14] [INFO ] Time to serialize gal into /tmp/LTL8951906185218355450.gal : 4 ms
[2024-06-02 23:00:14] [INFO ] Time to serialize properties into /tmp/LTL1876574695054202939.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8951906185218355450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1876574695054202939.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((p57==1)&&(p150==1))")U("(p75==1)"))U((F(!("((p57==1)&&(p150==1))")))&&(G(!("((p77==1)&&(p330==1))")))))))))
Formula 0 simplified : XXF((!"((p57==1)&&(p150==1))" R !"(p75==1)") R (G"((p57==1)&&(p150==1))" | F"((p77==1)&&(p330==1))"))
Detected timeout of ITS tools.
[2024-06-02 23:00:29] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:00:29] [INFO ] Applying decomposition
[2024-06-02 23:00:29] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16487428505549276797.txt' '-o' '/tmp/graph16487428505549276797.bin' '-w' '/tmp/graph16487428505549276797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16487428505549276797.bin' '-l' '-1' '-v' '-w' '/tmp/graph16487428505549276797.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:00:29] [INFO ] Decomposing Gal with order
[2024-06-02 23:00:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:00:29] [INFO ] Removed a total of 524 redundant transitions.
[2024-06-02 23:00:29] [INFO ] Flatten gal took : 69 ms
[2024-06-02 23:00:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 22 ms.
[2024-06-02 23:00:29] [INFO ] Time to serialize gal into /tmp/LTL5281683094421235600.gal : 7 ms
[2024-06-02 23:00:29] [INFO ] Time to serialize properties into /tmp/LTL12348141338760450367.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5281683094421235600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12348141338760450367.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((i4.u12.p57==1)&&(i5.u39.p150==1))")U("(i2.u11.p75==1)"))U((F(!("((i4.u12.p57==1)&&(i5.u39.p150==1))")))&&(G(!("((i2.u11....191
Formula 0 simplified : XXF((!"((i4.u12.p57==1)&&(i5.u39.p150==1))" R !"(i2.u11.p75==1)") R (G"((i4.u12.p57==1)&&(i5.u39.p150==1))" | F"((i2.u11.p77==1)&&(i...173
Reverse transition relation is NOT exact ! Due to transitions t27, t124, t230, t243, t245, t254, t257, t259, t264, t266, t267, t269, t274, t279, t281, t282...1124
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property FireWire-PT-17-LTLFireability-01 finished in 331554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 297 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 297 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 296 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Applied a total of 25 rules in 17 ms. Remains 296 /308 variables (removed 12) and now considering 500/532 (removed 32) transitions.
// Phase 1: matrix 500 rows 296 cols
[2024-06-02 23:00:44] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:00:45] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 23:00:45] [INFO ] Invariant cache hit.
[2024-06-02 23:00:45] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-06-02 23:00:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 188 places in 100 ms of which 9 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 142 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:00:51] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:00:51] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:00:52] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:00:52] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:00:52] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:00:54] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:00:54] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:00:55] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:00:56] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (OVERLAPS) 500/796 variables, 296/319 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:01:15] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 timeout
0.0)
(s267 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/796 variables, and 320 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 500/796 variables, 296/320 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 499/819 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:01:26] [INFO ] Deduced a trap composed of 111 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:01:28] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 821 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 19/19 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 296/308 places, 500/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 296/308 places, 500/532 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 97 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 40000 steps (17 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (11 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (13 resets) in 176 ms. (225 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (10 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 726519 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 3
Probabilistic random walk after 726519 steps, saw 143677 distinct states, run finished after 3002 ms. (steps per millisecond=242 ) properties seen :0
[2024-06-02 23:01:49] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 117/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 464/726 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 18/744 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 20/764 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/776 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/776 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/790 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/790 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/796 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/796 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/796 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 23:01:49] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 117/262 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 23:01:49] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 464/726 variables, 262/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 18/744 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 20/764 variables, 10/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/776 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/776 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/790 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/790 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/796 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/796 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/796 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 796/796 variables, and 308 constraints, problems are : Problem set: 0 solved, 3 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1125ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1774 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 500/500 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 281 transition count 429
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 229 transition count 425
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 107 place count 229 transition count 393
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 171 place count 197 transition count 393
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 196 transition count 373
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 196 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 174 place count 196 transition count 372
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 230 place count 168 transition count 344
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 292 place count 137 transition count 443
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 298 place count 137 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 334 place count 137 transition count 401
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 353 place count 137 transition count 382
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 378 place count 118 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 434 place count 118 transition count 320
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 436 place count 118 transition count 320
Applied a total of 436 rules in 50 ms. Remains 118 /296 variables (removed 178) and now considering 320/500 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 118/296 places, 320/500 transitions.
RANDOM walk for 40000 steps (2316 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (592 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (591 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (601 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 542470 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 3
Probabilistic random walk after 542470 steps, saw 163164 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-06-02 23:01:55] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
// Phase 1: matrix 283 rows 118 cols
[2024-06-02 23:01:55] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:01:55] [INFO ] State equation strengthened by 63 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 283/397 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 63/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/401 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 188 constraints, problems are : Problem set: 0 solved, 3 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 23:01:55] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 52/114 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 23:01:55] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 283/397 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 63/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/401 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/401 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 193 constraints, problems are : Problem set: 0 solved, 3 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 320/320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-06-02 23:01:56] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 23:01:56] [INFO ] Invariant cache hit.
[2024-06-02 23:01:56] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 23:01:56] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 23:01:56] [INFO ] Invariant cache hit.
[2024-06-02 23:01:56] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:01:56] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-02 23:01:56] [INFO ] Redundant transitions in 6 ms returned []
Running 316 sub problems to find dead transitions.
[2024-06-02 23:01:56] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 23:01:56] [INFO ] Invariant cache hit.
[2024-06-02 23:01:56] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:01:58] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:01:59] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:01:59] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:02:00] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:02:01] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:02:01] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:02:01] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:02:01] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 283/401 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 63/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 204 constraints, problems are : Problem set: 0 solved, 316 unsolved in 14790 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 283/401 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 63/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 316/520 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 23:02:16] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 521 constraints, problems are : Problem set: 0 solved, 316 unsolved in 21069 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 17/17 constraints]
After SMT, in 36010ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 36013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36317 ms. Remains : 118/118 places, 320/320 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 118 vertex of which 20 / 118 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 77 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 441 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 95 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 95 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 95 transition count 221
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 1 with 2 rules applied. Total rules applied 16 place count 94 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 92 transition count 224
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 28 place count 92 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 92 transition count 206
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 92 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 90 transition count 204
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 48 place count 87 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 54 place count 87 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 87 transition count 194
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 5 with 2 rules applied. Total rules applied 57 place count 86 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 58 place count 85 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 85 transition count 171
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 64 place count 85 transition count 166
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 69 place count 80 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 73 place count 80 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 75 place count 80 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 77 place count 78 transition count 160
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 81 place count 78 transition count 160
Applied a total of 81 rules in 34 ms. Remains 78 /118 variables (removed 40) and now considering 160/320 (removed 160) transitions.
Running SMT prover for 3 properties.
[2024-06-02 23:02:32] [INFO ] Flow matrix only has 158 transitions (discarded 2 similar events)
// Phase 1: matrix 158 rows 78 cols
[2024-06-02 23:02:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:02:32] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:02:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:32] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:02:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 23:02:32] [INFO ] After 20ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 23:02:32] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-02 23:02:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 1
[2024-06-02 23:02:32] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:02:32] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 326 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 500/500 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 280 transition count 435
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 101 place count 232 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 230 transition count 431
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 103 place count 230 transition count 399
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 167 place count 198 transition count 399
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 197 transition count 379
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 197 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 197 transition count 378
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 224 place count 170 transition count 351
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 290 place count 137 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 332 place count 137 transition count 413
Applied a total of 332 rules in 34 ms. Remains 137 /296 variables (removed 159) and now considering 413/500 (removed 87) transitions.
[2024-06-02 23:02:33] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
// Phase 1: matrix 394 rows 137 cols
[2024-06-02 23:02:33] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:02:33] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 23:02:33] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 23:02:33] [INFO ] Invariant cache hit.
[2024-06-02 23:02:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:02:33] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-06-02 23:02:33] [INFO ] Redundant transitions in 80 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-02 23:02:33] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 23:02:33] [INFO ] Invariant cache hit.
[2024-06-02 23:02:33] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 0 ms to minimize.
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-06-02 23:02:36] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 23:02:39] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 393/530 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (OVERLAPS) 0/530 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 214 constraints, problems are : Problem set: 0 solved, 403 unsolved in 18667 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 393/530 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 403/617 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 23:03:00] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (OVERLAPS) 0/530 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 618 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 10/10 constraints]
After SMT, in 48942ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 48945ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/296 places, 413/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49497 ms. Remains : 137/296 places, 413/500 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 40000 steps (3249 resets) in 575 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (692 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (704 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (679 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 815419 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :1 out of 3
Probabilistic random walk after 815419 steps, saw 225854 distinct states, run finished after 3002 ms. (steps per millisecond=271 ) properties seen :1
[2024-06-02 23:03:26] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 23:03:26] [INFO ] Invariant cache hit.
[2024-06-02 23:03:26] [INFO ] State equation strengthened by 61 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/133 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 393/526 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 61/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/133 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:03:26] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 393/526 variables, 133/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 61/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/530 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/530 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 425ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 413/413 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 137 transition count 410
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 22 place count 137 transition count 391
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 118 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 2 with 56 rules applied. Total rules applied 103 place count 118 transition count 329
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 118 transition count 329
Applied a total of 107 rules in 19 ms. Remains 118 /137 variables (removed 19) and now considering 329/413 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 118/137 places, 329/413 transitions.
RANDOM walk for 40000 steps (2392 resets) in 1284 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (599 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (588 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 236711 steps, run visited all 2 properties in 881 ms. (steps per millisecond=268 )
Probabilistic random walk after 236711 steps, saw 83679 distinct states, run finished after 882 ms. (steps per millisecond=268 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-17-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-17-LTLFireability-02 finished in 163344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X((p1&&G(p2))))))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 17 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:03:28] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:03:28] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:03:28] [INFO ] Invariant cache hit.
[2024-06-02 23:03:28] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:03:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 182 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 154 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:03:33] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:03:34] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 114 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:03:37] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:03:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:04:09] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
[2024-06-02 23:04:11] [INFO ] Deduced a trap composed of 115 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60531 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-03 finished in 60793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 240 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 292 transition count 463
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 240 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 239 transition count 461
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 108 place count 239 transition count 432
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 166 place count 210 transition count 432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 170 place count 206 transition count 409
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 206 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 174 place count 206 transition count 406
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 203 transition count 406
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 182 place count 201 transition count 404
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 201 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 201 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 200 transition count 402
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 243 place count 172 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 244 place count 171 transition count 354
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 171 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 171 transition count 353
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 312 place count 138 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 351 place count 138 transition count 420
Applied a total of 351 rules in 37 ms. Remains 138 /308 variables (removed 170) and now considering 420/532 (removed 112) transitions.
[2024-06-02 23:04:29] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
// Phase 1: matrix 404 rows 138 cols
[2024-06-02 23:04:29] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:04:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:04:29] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
[2024-06-02 23:04:29] [INFO ] Invariant cache hit.
[2024-06-02 23:04:29] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:04:29] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-02 23:04:29] [INFO ] Redundant transitions in 26 ms returned []
Running 407 sub problems to find dead transitions.
[2024-06-02 23:04:29] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
[2024-06-02 23:04:29] [INFO ] Invariant cache hit.
[2024-06-02 23:04:29] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (OVERLAPS) 403/541 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 62/216 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 23:04:39] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 23:04:40] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:04:40] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/541 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/542 variables, and 219 constraints, problems are : Problem set: 0 solved, 407 unsolved in 18597 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 403/541 variables, 138/157 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 62/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 407/626 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/541 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/542 variables, and 626 constraints, problems are : Problem set: 0 solved, 407 unsolved in 23503 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 12/12 constraints]
After SMT, in 42337ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 42341ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/308 places, 420/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42719 ms. Remains : 138/308 places, 420/532 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-05 finished in 42866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 236 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 292 transition count 466
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 243 transition count 464
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 242 transition count 461
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 110 place count 239 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 238 transition count 459
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 111 place count 238 transition count 431
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 167 place count 210 transition count 431
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 171 place count 206 transition count 408
Iterating global reduction 5 with 4 rules applied. Total rules applied 175 place count 206 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 175 place count 206 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 181 place count 203 transition count 405
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 201 transition count 403
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 201 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 187 place count 201 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 200 transition count 401
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 244 place count 172 transition count 373
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 171 transition count 353
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 171 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 171 transition count 352
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 311 place count 139 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 8 with 42 rules applied. Total rules applied 353 place count 139 transition count 411
Applied a total of 353 rules in 49 ms. Remains 139 /308 variables (removed 169) and now considering 411/532 (removed 121) transitions.
[2024-06-02 23:05:11] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
// Phase 1: matrix 392 rows 139 cols
[2024-06-02 23:05:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:05:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 23:05:12] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
[2024-06-02 23:05:12] [INFO ] Invariant cache hit.
[2024-06-02 23:05:12] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:05:12] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-02 23:05:12] [INFO ] Redundant transitions in 3 ms returned []
Running 407 sub problems to find dead transitions.
[2024-06-02 23:05:12] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
[2024-06-02 23:05:12] [INFO ] Invariant cache hit.
[2024-06-02 23:05:12] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 23:05:14] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:05:14] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:05:14] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:05:15] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:05:15] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:05:15] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:05:15] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 23:05:19] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 391/530 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 61/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 218 constraints, problems are : Problem set: 0 solved, 407 unsolved in 18126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 391/530 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 407/625 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 625 constraints, problems are : Problem set: 0 solved, 407 unsolved in 23161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 11/11 constraints]
After SMT, in 41520ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 41525ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/308 places, 411/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41857 ms. Remains : 139/308 places, 411/532 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-07 finished in 41974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(F(p1))||G(p2))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 303 transition count 527
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 303 transition count 527
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 299 transition count 523
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 299 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 299 transition count 522
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 298 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 298 transition count 521
Applied a total of 21 rules in 14 ms. Remains 298 /308 variables (removed 10) and now considering 521/532 (removed 11) transitions.
// Phase 1: matrix 521 rows 298 cols
[2024-06-02 23:05:53] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:05:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:05:54] [INFO ] Invariant cache hit.
[2024-06-02 23:05:54] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-06-02 23:05:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 23:05:59] [INFO ] Deduced a trap composed of 148 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:05:59] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:05:59] [INFO ] Deduced a trap composed of 156 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:05:59] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:05:59] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:06:00] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:06:00] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:06:00] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:06:00] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:06:01] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:06:01] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:06:01] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:06:03] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 23:06:04] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (OVERLAPS) 521/819 variables, 298/320 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 819/819 variables, and 320 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (OVERLAPS) 521/819 variables, 298/320 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 520/840 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 23:06:35] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:06:35] [INFO ] Deduced a trap composed of 115 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:06:38] [INFO ] Deduced a trap composed of 151 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:06:39] [INFO ] Deduced a trap composed of 157 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 4/844 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 844 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 19/19 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 298/308 places, 521/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60530 ms. Remains : 298/308 places, 521/532 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : FireWire-PT-17-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-08 finished in 60738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 302 transition count 507
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 302 transition count 507
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 297 transition count 502
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 297 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 296 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Applied a total of 25 rules in 16 ms. Remains 296 /308 variables (removed 12) and now considering 500/532 (removed 32) transitions.
// Phase 1: matrix 500 rows 296 cols
[2024-06-02 23:06:54] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:06:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:06:54] [INFO ] Invariant cache hit.
[2024-06-02 23:06:55] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-06-02 23:06:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:06:59] [INFO ] Deduced a trap composed of 141 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:07:00] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:07:00] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:07:00] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:07:01] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:07:01] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:07:01] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:07:01] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 3 ms to minimize.
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 148 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (OVERLAPS) 500/796 variables, 296/314 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/796 variables, and 316 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 500/796 variables, 296/316 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 499/815 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:07:34] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:07:42] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 817 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 15/15 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 296/308 places, 500/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60558 ms. Remains : 296/308 places, 500/532 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FireWire-PT-17-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-09 finished in 60722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(X(G((p2||X(!p3)))))))'
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 17 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:07:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:07:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:07:55] [INFO ] Invariant cache hit.
[2024-06-02 23:07:55] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:07:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:08:00] [INFO ] Deduced a trap composed of 182 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:08:00] [INFO ] Deduced a trap composed of 154 places in 84 ms of which 3 ms to minimize.
[2024-06-02 23:08:00] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:08:00] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:08:00] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:08:01] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:08:01] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:08:01] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:08:01] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:08:03] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:08:05] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:08:06] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:08:36] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:08:38] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 506 ms :[(AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), (AND (NOT p2) p3), p3, true, (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p0 (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p2) p3), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 20024 reset in 122 ms.
Product exploration explored 100000 steps with 19996 reset in 140 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 120 ms. Reduced automaton from 13 states, 34 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (14 resets) in 114 ms. (347 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-06-02 23:08:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/742 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/762 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/774 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/788 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/794 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 233 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 428
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 230 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 228 transition count 424
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 228 transition count 391
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 195 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 194 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 194 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 194 transition count 370
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 232 place count 166 transition count 342
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 294 place count 135 transition count 441
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 300 place count 135 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 336 place count 135 transition count 399
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 356 place count 135 transition count 379
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 382 place count 115 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 438 place count 115 transition count 317
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 115 transition count 317
Applied a total of 440 rules in 55 ms. Remains 115 /295 variables (removed 180) and now considering 317/499 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 115/295 places, 317/499 transitions.
RANDOM walk for 40000 steps (2338 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (234 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4915 steps, run visited all 1 properties in 14 ms. (steps per millisecond=351 )
Probabilistic random walk after 4915 steps, saw 1781 distinct states, run finished after 14 ms. (steps per millisecond=351 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 12 factoid took 197 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Support contains 4 out of 295 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 7 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 23:08:58] [INFO ] Invariant cache hit.
[2024-06-02 23:08:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:08:58] [INFO ] Invariant cache hit.
[2024-06-02 23:08:58] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:08:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 182 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 154 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:09:04] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:09:04] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:09:04] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:09:06] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:09:39] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:09:41] [INFO ] Deduced a trap composed of 115 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 295/295 places, 499/499 transitions.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (13 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 68 ms. (579 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (17 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-06-02 23:09:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/742 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/762 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/774 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/788 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/794 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 683ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 233 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 428
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 230 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 228 transition count 424
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 228 transition count 391
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 195 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 194 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 194 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 194 transition count 370
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 232 place count 166 transition count 342
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 294 place count 135 transition count 441
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 300 place count 135 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 336 place count 135 transition count 399
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 356 place count 135 transition count 379
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 382 place count 115 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 438 place count 115 transition count 317
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 115 transition count 317
Applied a total of 440 rules in 33 ms. Remains 115 /295 variables (removed 180) and now considering 317/499 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 115/295 places, 317/499 transitions.
RANDOM walk for 40000 steps (2337 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38789 steps (210 resets) in 27 ms. (1385 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 94 ms.
Product exploration explored 100000 steps with 1 reset in 97 ms.
Built C files in :
/tmp/ltsmin1696997519602723064
[2024-06-02 23:10:01] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1696997519602723064
Running compilation step : cd /tmp/ltsmin1696997519602723064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 839 ms.
Running link step : cd /tmp/ltsmin1696997519602723064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1696997519602723064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12629457853609332975.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 5 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 23:10:16] [INFO ] Invariant cache hit.
[2024-06-02 23:10:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 23:10:16] [INFO ] Invariant cache hit.
[2024-06-02 23:10:16] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:10:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 182 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 154 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:10:22] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:10:23] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 0 ms to minimize.
[2024-06-02 23:10:23] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:10:23] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:10:23] [INFO ] Deduced a trap composed of 114 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:10:23] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:10:24] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:10:25] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:10:26] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:10:59] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in LTL mode , in 1 iterations and 60550 ms. Remains : 295/295 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin5922691920189707419
[2024-06-02 23:11:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5922691920189707419
Running compilation step : cd /tmp/ltsmin5922691920189707419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 816 ms.
Running link step : cd /tmp/ltsmin5922691920189707419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5922691920189707419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2378112120785510865.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:11:31] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:11:31] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:11:31] [INFO ] Time to serialize gal into /tmp/LTL3794926898158329988.gal : 3 ms
[2024-06-02 23:11:31] [INFO ] Time to serialize properties into /tmp/LTL13668312884595022219.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3794926898158329988.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7936696189872093156.hoa' '-atoms' '/tmp/LTL13668312884595022219.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13668312884595022219.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7936696189872093156.hoa
Detected timeout of ITS tools.
[2024-06-02 23:11:46] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:11:46] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:11:46] [INFO ] Time to serialize gal into /tmp/LTL4136977363045873149.gal : 3 ms
[2024-06-02 23:11:46] [INFO ] Time to serialize properties into /tmp/LTL12838795707864522984.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4136977363045873149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12838795707864522984.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("((p32==1)&&(p123==1))"))&&(X("(p309==1)")))U(X(X(G((X(!("((p70==1)&&(p282==1))")))||("((p71==1)&&(p186==1))")))))))
Formula 0 simplified : (F!"((p32==1)&&(p123==1))" | X!"(p309==1)") R XXF(!"((p71==1)&&(p186==1))" & X"((p70==1)&&(p282==1))")
Detected timeout of ITS tools.
[2024-06-02 23:12:02] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:12:02] [INFO ] Applying decomposition
[2024-06-02 23:12:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3272192738821370968.txt' '-o' '/tmp/graph3272192738821370968.bin' '-w' '/tmp/graph3272192738821370968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3272192738821370968.bin' '-l' '-1' '-v' '-w' '/tmp/graph3272192738821370968.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:12:02] [INFO ] Decomposing Gal with order
[2024-06-02 23:12:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:12:02] [INFO ] Removed a total of 525 redundant transitions.
[2024-06-02 23:12:02] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:12:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2024-06-02 23:12:02] [INFO ] Time to serialize gal into /tmp/LTL4933626445976696873.gal : 4 ms
[2024-06-02 23:12:02] [INFO ] Time to serialize properties into /tmp/LTL5609645657050413377.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4933626445976696873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5609645657050413377.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((G("((i5.u10.p32==1)&&(i5.u31.p123==1))"))&&(X("(i1.u81.p309==1)")))U(X(X(G((X(!("((i2.u18.p70==1)&&(i10.u74.p282==1))")))||("((i2...194
Formula 0 simplified : (F!"((i5.u10.p32==1)&&(i5.u31.p123==1))" | X!"(i1.u81.p309==1)") R XXF(!"((i2.u18.p71==1)&&(i7.u22.p186==1))" & X"((i2.u18.p70==1)&&...175
Reverse transition relation is NOT exact ! Due to transitions t27, t124, t229, t230, t243, t244, t245, t254, t268, t279, t281, t282, t297, t354, t371, t372...1113
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property FireWire-PT-17-LTLFireability-11 finished in 261832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0&&F(!p1)&&X(X(F(p2))))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 302 transition count 507
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 302 transition count 507
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 298 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 298 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 297 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 297 transition count 502
Applied a total of 22 rules in 15 ms. Remains 297 /308 variables (removed 11) and now considering 502/532 (removed 30) transitions.
// Phase 1: matrix 502 rows 297 cols
[2024-06-02 23:12:17] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:12:17] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 23:12:17] [INFO ] Invariant cache hit.
[2024-06-02 23:12:17] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-06-02 23:12:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:12:22] [INFO ] Deduced a trap composed of 184 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:12:22] [INFO ] Deduced a trap composed of 156 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:12:22] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:12:23] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:12:23] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:12:23] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:12:23] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:12:24] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:12:24] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:12:26] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:12:26] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:12:27] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 144 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 143 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:12:33] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 502/799 variables, 297/322 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/799 variables, and 322 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 502/799 variables, 297/322 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 501/823 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:12:58] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:12:58] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/799 variables, and 825 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 20/20 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 297/308 places, 502/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60550 ms. Remains : 297/308 places, 502/532 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), true, (AND (NOT p2) (NOT p0)), (AND p1 (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), p1]
Running random walk in product with property : FireWire-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 14 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-17-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-17-LTLFireability-12 finished in 61099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 242 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 237 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 457
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 115 place count 236 transition count 428
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 173 place count 207 transition count 428
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 204 transition count 425
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 204 transition count 425
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 179 place count 204 transition count 422
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 201 transition count 422
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 199 transition count 420
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 199 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 198 transition count 418
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 248 place count 170 transition count 390
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 169 transition count 370
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 169 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 169 transition count 369
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 313 place count 138 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 7 with 58 rules applied. Total rules applied 371 place count 138 transition count 437
Applied a total of 371 rules in 38 ms. Remains 138 /308 variables (removed 170) and now considering 437/532 (removed 95) transitions.
[2024-06-02 23:13:18] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
// Phase 1: matrix 413 rows 138 cols
[2024-06-02 23:13:18] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:13:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:13:18] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
[2024-06-02 23:13:18] [INFO ] Invariant cache hit.
[2024-06-02 23:13:18] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:13:18] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 23:13:18] [INFO ] Redundant transitions in 2 ms returned []
Running 433 sub problems to find dead transitions.
[2024-06-02 23:13:18] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
[2024-06-02 23:13:18] [INFO ] Invariant cache hit.
[2024-06-02 23:13:18] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 3 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 412/550 variables, 138/155 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 62/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (OVERLAPS) 0/550 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/551 variables, and 217 constraints, problems are : Problem set: 0 solved, 433 unsolved in 14756 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (OVERLAPS) 412/550 variables, 138/155 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 62/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 433/650 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 10 (OVERLAPS) 0/550 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/551 variables, and 650 constraints, problems are : Problem set: 0 solved, 433 unsolved in 27186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 10/10 constraints]
After SMT, in 42189ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 42192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/308 places, 437/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42551 ms. Remains : 138/308 places, 437/532 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-13 finished in 42621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p1)&&X(p2)))&&p0)))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 15 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:14:00] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:14:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:14:01] [INFO ] Invariant cache hit.
[2024-06-02 23:14:01] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:14:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:14:05] [INFO ] Deduced a trap composed of 182 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 154 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:14:07] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:14:07] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:14:07] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:14:08] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:14:08] [INFO ] Deduced a trap composed of 114 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:14:08] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:14:08] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:14:10] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:14:11] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:14:44] [INFO ] Deduced a trap composed of 115 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-14
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-14 finished in 60781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 13 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
[2024-06-02 23:15:01] [INFO ] Invariant cache hit.
[2024-06-02 23:15:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:15:01] [INFO ] Invariant cache hit.
[2024-06-02 23:15:02] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:15:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:15:06] [INFO ] Deduced a trap composed of 182 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:15:06] [INFO ] Deduced a trap composed of 154 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:15:06] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:15:07] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:15:07] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:15:07] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:15:07] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:15:07] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:15:07] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 0 ms to minimize.
[2024-06-02 23:15:08] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:15:08] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:15:08] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:15:09] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:15:09] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:15:09] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:15:11] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:15:12] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:15:42] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:15:44] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60528 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-17-LTLFireability-15 finished in 60730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1) U (F(!p0)&&G(!p2)))))))'
Found a Lengthening insensitive property : FireWire-PT-17-LTLFireability-01
Stuttering acceptance computed with spot in 317 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 236 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 237 transition count 458
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 113 place count 237 transition count 430
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 169 place count 209 transition count 430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 205 transition count 407
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 205 transition count 407
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 177 place count 205 transition count 404
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 202 transition count 404
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 200 transition count 402
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 200 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 200 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 190 place count 199 transition count 400
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 246 place count 171 transition count 372
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -131
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 308 place count 140 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 314 place count 140 transition count 497
Applied a total of 314 rules in 31 ms. Remains 140 /308 variables (removed 168) and now considering 497/532 (removed 35) transitions.
[2024-06-02 23:16:02] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
// Phase 1: matrix 475 rows 140 cols
[2024-06-02 23:16:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:16:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:16:02] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:16:02] [INFO ] Invariant cache hit.
[2024-06-02 23:16:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 23:16:03] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 487 sub problems to find dead transitions.
[2024-06-02 23:16:03] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:16:03] [INFO ] Invariant cache hit.
[2024-06-02 23:16:03] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/615 variables, and 232 constraints, problems are : Problem set: 0 solved, 487 unsolved in 17429 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 487/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 23:16:40] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/614 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/615 variables, and 720 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 11/11 constraints]
After SMT, in 47833ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 47838ms
Starting structural reductions in LI_LTL mode, iteration 1 : 140/308 places, 497/532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 48204 ms. Remains : 140/308 places, 497/532 transitions.
Running random walk in product with property : FireWire-PT-17-LTLFireability-01
Product exploration explored 100000 steps with 4 reset in 45 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 128 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (2769 resets) in 364 ms. (109 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40002 steps (729 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (685 resets) in 250 ms. (159 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (682 resets) in 463 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (720 resets) in 280 ms. (142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (734 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (703 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (680 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
[2024-06-02 23:16:52] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:16:52] [INFO ] Invariant cache hit.
[2024-06-02 23:16:52] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 111/116 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 23:16:52] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 23:16:52] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/136 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 474/610 variables, 136/145 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 75/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/614 variables, 4/224 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/614 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/615 variables, and 224 constraints, problems are : Problem set: 2 solved, 5 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 20/136 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 474/610 variables, 136/145 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 75/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 5/225 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/614 variables, 4/229 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/229 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/614 variables, 0/229 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/615 variables, and 229 constraints, problems are : Problem set: 2 solved, 5 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1066ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 557 ms.
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 497/497 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 140 transition count 494
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 58 place count 140 transition count 439
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 140 transition count 419
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 104 place count 120 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 2 with 55 rules applied. Total rules applied 159 place count 120 transition count 358
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 164 place count 120 transition count 358
Applied a total of 164 rules in 32 ms. Remains 120 /140 variables (removed 20) and now considering 358/497 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 120/140 places, 358/497 transitions.
RANDOM walk for 40000 steps (2020 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (668 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (19 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (19 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (485 resets) in 269 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 84371 steps, run visited all 5 properties in 431 ms. (steps per millisecond=195 )
Probabilistic random walk after 84371 steps, saw 32433 distinct states, run finished after 431 ms. (steps per millisecond=195 ) properties seen :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p1))), (G (AND (OR (NOT p1) (NOT p2)) (OR (NOT p2) (NOT p0)))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (OR (NOT p1) p2) (OR p2 (NOT p0))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 12 factoid took 658 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 162 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-06-02 23:16:56] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:16:56] [INFO ] Invariant cache hit.
[2024-06-02 23:16:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:16:56] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:16:56] [INFO ] Invariant cache hit.
[2024-06-02 23:16:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 23:16:56] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 487 sub problems to find dead transitions.
[2024-06-02 23:16:56] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:16:56] [INFO ] Invariant cache hit.
[2024-06-02 23:16:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 23:16:59] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:16:59] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:16:59] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:17:01] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:17:01] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/615 variables, and 232 constraints, problems are : Problem set: 0 solved, 487 unsolved in 17260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 487/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 23:17:34] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/614 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/615 variables, and 720 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 11/11 constraints]
After SMT, in 47757ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 47762ms
Finished structural reductions in LTL mode , in 1 iterations and 48102 ms. Remains : 140/140 places, 497/497 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
RANDOM walk for 40000 steps (2766 resets) in 315 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (666 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (728 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (659 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1075660 steps, run visited all 3 properties in 2748 ms. (steps per millisecond=391 )
Probabilistic random walk after 1075660 steps, saw 306887 distinct states, run finished after 2748 ms. (steps per millisecond=391 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F p0), (F p2)]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 176 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 165 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 497
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 56 place count 140 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 56 rules in 12 ms. Remains 140 /140 variables (removed 0) and now considering 442/497 (removed 55) transitions.
[2024-06-02 23:17:48] [INFO ] Redundant transitions in 22 ms returned []
Running 432 sub problems to find dead transitions.
[2024-06-02 23:17:48] [INFO ] Flow matrix only has 418 transitions (discarded 24 similar events)
// Phase 1: matrix 418 rows 140 cols
[2024-06-02 23:17:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:17:48] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:17:50] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 431 unsolved
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:17:54] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:17:54] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 9/17 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 6 (OVERLAPS) 417/557 variables, 140/157 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 62/219 constraints. Problems are: Problem set: 1 solved, 431 unsolved
[2024-06-02 23:18:00] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:18:01] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 10 (OVERLAPS) 0/557 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/558 variables, and 221 constraints, problems are : Problem set: 1 solved, 431 unsolved in 22859 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 2/140 variables, 7/14 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 5 (OVERLAPS) 417/557 variables, 140/159 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 62/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 431/652 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/558 variables, and 652 constraints, problems are : Problem set: 1 solved, 431 unsolved in 27154 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 431/432 constraints, Known Traps: 12/12 constraints]
After SMT, in 50320ms problems are : Problem set: 1 solved, 431 unsolved
Search for dead transitions found 1 dead transitions in 50324ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 140/140 places, 441/497 transitions.
Graph (complete) has 754 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 139 /140 variables (removed 1) and now considering 441/441 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 139/140 places, 441/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50375 ms. Remains : 139/140 places, 441/497 transitions.
Built C files in :
/tmp/ltsmin16139301593401639643
[2024-06-02 23:18:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16139301593401639643
Running compilation step : cd /tmp/ltsmin16139301593401639643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin16139301593401639643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16139301593401639643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8517424439823190972.hoa' '--buchi-type=spotba'
LTSmin run took 10266 ms.
Treatment of property FireWire-PT-17-LTLFireability-01 finished in 167691 ms.
FORMULA FireWire-PT-17-LTLFireability-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(X(G((p2||X(!p3)))))))'
Found a Lengthening insensitive property : FireWire-PT-17-LTLFireability-11
Stuttering acceptance computed with spot in 536 ms :[(AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), (AND (NOT p2) p3), p3, true, (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p0 (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p2) p3), (NOT p0)]
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 237 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 237 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 457
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 115 place count 236 transition count 429
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 171 place count 208 transition count 429
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 175 place count 204 transition count 406
Iterating global reduction 4 with 4 rules applied. Total rules applied 179 place count 204 transition count 406
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 179 place count 204 transition count 403
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 201 transition count 403
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 199 transition count 401
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 199 transition count 401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 198 transition count 399
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 248 place count 170 transition count 371
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 169 transition count 351
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 169 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 169 transition count 350
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 313 place count 138 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 319 place count 138 transition count 438
Applied a total of 319 rules in 44 ms. Remains 138 /308 variables (removed 170) and now considering 438/532 (removed 94) transitions.
[2024-06-02 23:18:50] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
// Phase 1: matrix 419 rows 138 cols
[2024-06-02 23:18:50] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:18:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:18:50] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:18:50] [INFO ] Invariant cache hit.
[2024-06-02 23:18:50] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:18:51] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-02 23:18:51] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:18:51] [INFO ] Invariant cache hit.
[2024-06-02 23:18:51] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:18:53] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:18:53] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 428 unsolved in 14617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 428/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 653 constraints, problems are : Problem set: 0 solved, 428 unsolved in 25172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
After SMT, in 40057ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 40061ms
Starting structural reductions in LI_LTL mode, iteration 1 : 138/308 places, 438/532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 40429 ms. Remains : 138/308 places, 438/532 transitions.
Running random walk in product with property : FireWire-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 19959 reset in 164 ms.
Product exploration explored 100000 steps with 20084 reset in 180 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 94 ms. Reduced automaton from 13 states, 34 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (3172 resets) in 88 ms. (449 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (673 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-06-02 23:19:31] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:19:31] [INFO ] Invariant cache hit.
[2024-06-02 23:19:31] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/556 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/556 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 438/438 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 138 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 138 transition count 434
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 137 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 135 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 47 place count 135 transition count 406
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 135 transition count 386
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 93 place count 115 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 2 with 58 rules applied. Total rules applied 151 place count 115 transition count 322
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 115 transition count 322
Applied a total of 155 rules in 21 ms. Remains 115 /138 variables (removed 23) and now considering 322/438 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 115/138 places, 322/438 transitions.
RANDOM walk for 40000 steps (2471 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 27372 steps (162 resets) in 20 ms. (1303 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 12 factoid took 245 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Support contains 4 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 438/438 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2024-06-02 23:19:32] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:19:32] [INFO ] Invariant cache hit.
[2024-06-02 23:19:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:19:33] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:19:33] [INFO ] Invariant cache hit.
[2024-06-02 23:19:33] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:19:33] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-02 23:19:33] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:19:33] [INFO ] Invariant cache hit.
[2024-06-02 23:19:33] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 23:19:35] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 428 unsolved in 14537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 428/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 653 constraints, problems are : Problem set: 0 solved, 428 unsolved in 25144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
After SMT, in 39965ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 39970ms
Finished structural reductions in LTL mode , in 1 iterations and 40268 ms. Remains : 138/138 places, 438/438 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (3184 resets) in 79 ms. (500 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (670 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2024-06-02 23:20:13] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:20:13] [INFO ] Invariant cache hit.
[2024-06-02 23:20:13] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/556 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/556 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 438/438 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 138 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 138 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 137 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 135 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 47 place count 135 transition count 406
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 135 transition count 386
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 93 place count 115 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 2 with 58 rules applied. Total rules applied 151 place count 115 transition count 322
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 115 transition count 322
Applied a total of 155 rules in 19 ms. Remains 115 /138 variables (removed 23) and now considering 322/438 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 115/138 places, 322/438 transitions.
RANDOM walk for 40000 steps (2435 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31573 steps (184 resets) in 21 ms. (1435 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 53 ms.
Product exploration explored 100000 steps with 5 reset in 80 ms.
Built C files in :
/tmp/ltsmin16108002885918814371
[2024-06-02 23:20:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16108002885918814371
Running compilation step : cd /tmp/ltsmin16108002885918814371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 747 ms.
Running link step : cd /tmp/ltsmin16108002885918814371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16108002885918814371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10875921492084627324.hoa' '--buchi-type=spotba'
LTSmin run took 2639 ms.
Treatment of property FireWire-PT-17-LTLFireability-11 finished in 88075 ms.
FORMULA FireWire-PT-17-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 23:20:18] [INFO ] Flatten gal took : 17 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1590838 ms.

BK_STOP 1717370418267

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="FireWire-PT-17"
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-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-17, 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 r550-tall-171734899000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-17.tgz
mv FireWire-PT-17 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;