About the Execution of ITS-Tools for FireWire-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1041.623 | 195993.00 | 255353.00 | 580.80 | FFFFFFFTFFFFFFFF | normal |
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-171734898700180.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 86K 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-02-LTLFireability-00
FORMULA_NAME FireWire-PT-02-LTLFireability-01
FORMULA_NAME FireWire-PT-02-LTLFireability-02
FORMULA_NAME FireWire-PT-02-LTLFireability-03
FORMULA_NAME FireWire-PT-02-LTLFireability-04
FORMULA_NAME FireWire-PT-02-LTLFireability-05
FORMULA_NAME FireWire-PT-02-LTLFireability-06
FORMULA_NAME FireWire-PT-02-LTLFireability-07
FORMULA_NAME FireWire-PT-02-LTLFireability-08
FORMULA_NAME FireWire-PT-02-LTLFireability-09
FORMULA_NAME FireWire-PT-02-LTLFireability-10
FORMULA_NAME FireWire-PT-02-LTLFireability-11
FORMULA_NAME FireWire-PT-02-LTLFireability-12
FORMULA_NAME FireWire-PT-02-LTLFireability-13
FORMULA_NAME FireWire-PT-02-LTLFireability-14
FORMULA_NAME FireWire-PT-02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717359164147
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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 20:12:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:12:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:12:45] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 20:12:45] [INFO ] Transformed 108 places.
[2024-06-02 20:12:45] [INFO ] Transformed 355 transitions.
[2024-06-02 20:12:45] [INFO ] Found NUPN structural information;
[2024-06-02 20:12:45] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 171 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 2 formulas.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
FORMULA FireWire-PT-02-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 105 transition count 294
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 105 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 105 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 104 transition count 284
Applied a total of 16 rules in 45 ms. Remains 104 /108 variables (removed 4) and now considering 284/301 (removed 17) transitions.
[2024-06-02 20:12:45] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 104 cols
[2024-06-02 20:12:45] [INFO ] Computed 8 invariants in 10 ms
[2024-06-02 20:12:45] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-02 20:12:45] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 20:12:45] [INFO ] Invariant cache hit.
[2024-06-02 20:12:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:12:46] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-02 20:12:46] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 20:12:46] [INFO ] Invariant cache hit.
[2024-06-02 20:12:46] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:12:47] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 10 ms to minimize.
[2024-06-02 20:12:47] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:12:48] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:12:48] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:12:48] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:12:48] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:12:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 257/361 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:12:50] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:12:54] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:12:54] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (OVERLAPS) 0/362 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 161 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14524 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 257/361 variables, 104/122 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 283/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 444 constraints, problems are : Problem set: 0 solved, 283 unsolved in 17540 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 10/10 constraints]
After SMT, in 32328ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 32353ms
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 284/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32784 ms. Remains : 104/108 places, 284/301 transitions.
Support contains 41 out of 104 places after structural reductions.
[2024-06-02 20:13:18] [INFO ] Flatten gal took : 45 ms
[2024-06-02 20:13:18] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:13:18] [INFO ] Input system was already deterministic with 284 transitions.
Reduction of identical properties reduced properties to check from 34 to 31
RANDOM walk for 40000 steps (2173 resets) in 1514 ms. (26 steps per ms) remains 13/31 properties
BEST_FIRST walk for 40001 steps (1066 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (601 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (589 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (585 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (556 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (544 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 95 ms. (416 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (11 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (12 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (559 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (570 resets) in 107 ms. (370 steps per ms) remains 10/11 properties
[2024-06-02 20:13:19] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 20:13:19] [INFO ] Invariant cache hit.
[2024-06-02 20:13:19] [INFO ] State equation strengthened by 39 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, 10 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/95 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/103 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 20:13:19] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 257/360 variables, 103/112 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 38/150 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/361 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/362 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 152 constraints, problems are : Problem set: 1 solved, 9 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 80/95 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/103 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 20:13:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:13:20] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 257/360 variables, 103/114 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 38/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 7/159 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/361 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 2/162 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/362 variables, 1/163 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/362 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 163 constraints, problems are : Problem set: 1 solved, 9 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 1384ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 3 properties in 3184 ms.
Support contains 10 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 284/284 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 103 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 103 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 102 transition count 279
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 101 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 101 transition count 276
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 98 transition count 282
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 98 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 98 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 98 transition count 275
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 97 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 97 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 96 transition count 270
Applied a total of 31 rules in 75 ms. Remains 96 /104 variables (removed 8) and now considering 270/284 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 96/104 places, 270/284 transitions.
RANDOM walk for 40000 steps (2522 resets) in 701 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1422 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (690 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (609 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (78 resets) in 257 ms. (155 steps per ms) remains 4/6 properties
[2024-06-02 20:13:24] [INFO ] Flow matrix only has 241 transitions (discarded 29 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 20:13:24] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:13:24] [INFO ] State equation strengthened by 38 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) 61/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 215/284 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 49/333 variables, 24/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/337 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 142 constraints, problems are : Problem set: 0 solved, 4 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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) 61/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 215/284 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 49/333 variables, 24/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/337 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:13:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/337 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 147 constraints, problems are : Problem set: 0 solved, 4 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 532 ms.
Support contains 8 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 270/270 transitions.
Applied a total of 0 rules in 18 ms. Remains 96 /96 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 96/96 places, 270/270 transitions.
RANDOM walk for 40000 steps (2585 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1461 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (620 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (687 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 140309 steps, run visited all 4 properties in 295 ms. (steps per millisecond=475 )
Probabilistic random walk after 140309 steps, saw 35315 distinct states, run finished after 299 ms. (steps per millisecond=469 ) properties seen :4
FORMULA FireWire-PT-02-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-02-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 6 stabilizing places and 11 stable transitions
FORMULA FireWire-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(p1))))||((p0||X(G(p1)))&&X(X(F(!p2))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 6 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 20:13:26] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 20:13:26] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:13:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:13:26] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:26] [INFO ] Invariant cache hit.
[2024-06-02 20:13:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:13:27] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), p2, (NOT p1)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-00 finished in 627 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) U X(G((p1||F(p2)))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 11 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 20:13:27] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:27] [INFO ] Invariant cache hit.
[2024-06-02 20:13:27] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:13:27] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:27] [INFO ] Invariant cache hit.
[2024-06-02 20:13:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:13:27] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 20:13:27] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:27] [INFO ] Invariant cache hit.
[2024-06-02 20:13:27] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:13:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/343 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 153 constraints, problems are : Problem set: 0 solved, 270 unsolved in 9768 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/343 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 270/422 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/344 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/344 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 423 constraints, problems are : Problem set: 0 solved, 270 unsolved in 17292 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 27221ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27227ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 271/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27432 ms. Remains : 99/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-01 finished in 27803 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) U (X(p1)||!p1)) U X(p0))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 8 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 20:13:55] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:55] [INFO ] Invariant cache hit.
[2024-06-02 20:13:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:13:55] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:55] [INFO ] Invariant cache hit.
[2024-06-02 20:13:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:13:55] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, p0, p0, p0]
Running random walk in product with property : FireWire-PT-02-LTLFireability-04
Product exploration explored 100000 steps with 1 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2178 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (577 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1385 ms. (steps per millisecond=770 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1385 ms. (steps per millisecond=770 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 123 ms :[true, p0, p0, p0]
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 20:13:57] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 20:13:57] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:13:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:13:58] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:58] [INFO ] Invariant cache hit.
[2024-06-02 20:13:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:13:58] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 20:13:58] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:13:58] [INFO ] Invariant cache hit.
[2024-06-02 20:13:58] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:13:59] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:13:59] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:13:59] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:13:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:14:00] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:14:00] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:14:00] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:14:00] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:14:00] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 25726ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25729ms
Finished structural reductions in LTL mode , in 1 iterations and 25996 ms. Remains : 98/98 places, 271/271 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (2198 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (554 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1066644 steps, run visited all 1 properties in 1396 ms. (steps per millisecond=764 )
Probabilistic random walk after 1066644 steps, saw 195392 distinct states, run finished after 1396 ms. (steps per millisecond=764 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 126 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 132 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 1 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, p0, p0, p0]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 98 transition count 271
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 98 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 97 transition count 270
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 97 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 97 transition count 282
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 276
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 25 ms. Remains 97 /98 variables (removed 1) and now considering 276/271 (removed -5) transitions.
[2024-06-02 20:14:26] [INFO ] Redundant transitions in 11 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:14:26] [INFO ] Flow matrix only has 243 transitions (discarded 33 similar events)
// Phase 1: matrix 243 rows 97 cols
[2024-06-02 20:14:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:14:26] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:14:27] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 20:14:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-02 20:14:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 4 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-02 20:14:28] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:14:28] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:14:28] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:14:28] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:14:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:14:28] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:14:28] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 10/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
Problem TDEAD250 is UNSAT
At refinement iteration 4 (OVERLAPS) 242/339 variables, 97/114 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 39/153 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/153 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/340 variables, 1/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 154 constraints, problems are : Problem set: 7 solved, 268 unsolved in 9732 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 7 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 4/96 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 10/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 242/338 variables, 96/113 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 39/152 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 268/420 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/420 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/339 variables, 1/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 422 constraints, problems are : Problem set: 7 solved, 268 unsolved in 18837 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 268/275 constraints, Known Traps: 10/10 constraints]
After SMT, in 28702ms problems are : Problem set: 7 solved, 268 unsolved
Search for dead transitions found 7 dead transitions in 28709ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 97/98 places, 269/271 transitions.
Graph (complete) has 522 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 93 /97 variables (removed 4) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/98 places, 269/271 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28771 ms. Remains : 93/98 places, 269/271 transitions.
Built C files in :
/tmp/ltsmin8786411575646453945
[2024-06-02 20:14:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8786411575646453945
Running compilation step : cd /tmp/ltsmin8786411575646453945;'/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 581 ms.
Running link step : cd /tmp/ltsmin8786411575646453945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8786411575646453945;'/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/stateBased7722864785219065732.hoa' '--buchi-type=spotba'
LTSmin run took 2702 ms.
FORMULA FireWire-PT-02-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-02-LTLFireability-04 finished in 63577 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) U (p1&&X(F((F(!p3)&&p2))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 2 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 20:14:58] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 20:14:58] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:14:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:14:58] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:14:58] [INFO ] Invariant cache hit.
[2024-06-02 20:14:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:14:59] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p1) p3), (NOT p0), (OR (NOT p2) p3), p3]
Running random walk in product with property : FireWire-PT-02-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-05 finished in 357 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 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 279
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 102 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 101 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 101 transition count 276
Applied a total of 7 rules in 3 ms. Remains 101 /104 variables (removed 3) and now considering 276/284 (removed 8) transitions.
[2024-06-02 20:14:59] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 20:14:59] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:14:59] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:14:59] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 20:14:59] [INFO ] Invariant cache hit.
[2024-06-02 20:14:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:14:59] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/104 places, 276/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 100/104 places, 276/284 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-02-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-02-LTLFireability-07 finished in 754 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) U p1))||G(!p1)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 5 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 20:15:00] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 20:15:00] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:15:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:15:00] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:15:00] [INFO ] Invariant cache hit.
[2024-06-02 20:15:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:15:00] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 167 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 261 ms :[false, (NOT p1), false, (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-08
Product exploration explored 100000 steps with 25006 reset in 109 ms.
Product exploration explored 100000 steps with 25104 reset in 100 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 81 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (2168 resets) in 85 ms. (465 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 20:15:01] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 20:15:01] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:15:01] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/94 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/335 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/339 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/342 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/343 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/343 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/94 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/335 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/339 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/342 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/343 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1639 steps, including 187 resets, run visited all 1 properties in 5 ms. (steps per millisecond=327 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 96 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 95 transition count 268
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 2 with 4 rules applied. Total rules applied 8 place count 93 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 93 transition count 268
Applied a total of 12 rules in 22 ms. Remains 93 /98 variables (removed 5) and now considering 268/271 (removed 3) transitions.
[2024-06-02 20:15:02] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
// Phase 1: matrix 238 rows 93 cols
[2024-06-02 20:15:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:15:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:15:02] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 20:15:02] [INFO ] Invariant cache hit.
[2024-06-02 20:15:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:15:02] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-02 20:15:02] [INFO ] Redundant transitions in 4 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 20:15:02] [INFO ] Flow matrix only has 238 transitions (discarded 30 similar events)
[2024-06-02 20:15:02] [INFO ] Invariant cache hit.
[2024-06-02 20:15:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:15:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:15:04] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 237/329 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/330 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8528 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 237/329 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 14062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 22778ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 22782ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/98 places, 268/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23009 ms. Remains : 93/98 places, 268/271 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 117 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
RANDOM walk for 30869 steps (1965 resets) in 98 ms. (311 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 13 factoid took 393 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 64 ms.
Built C files in :
/tmp/ltsmin2166227428106192275
[2024-06-02 20:15:27] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-06-02 20:15:27] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:15:27] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-06-02 20:15:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:15:27] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-06-02 20:15:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:15:27] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2166227428106192275
Running compilation step : cd /tmp/ltsmin2166227428106192275;'/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 584 ms.
Running link step : cd /tmp/ltsmin2166227428106192275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2166227428106192275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15722700221400642833.hoa' '--buchi-type=spotba'
LTSmin run took 344 ms.
FORMULA FireWire-PT-02-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-02-LTLFireability-08 finished in 28272 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&&((p1 U p2) U (G((p1 U p2))||(!p3&&(p1 U p2))))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 99 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 99 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 99 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 98 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 98 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 95 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 95 transition count 273
Applied a total of 23 rules in 24 ms. Remains 95 /104 variables (removed 9) and now considering 273/284 (removed 11) transitions.
[2024-06-02 20:15:28] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 20:15:28] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:15:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:15:28] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 20:15:28] [INFO ] Invariant cache hit.
[2024-06-02 20:15:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:15:28] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 247 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/104 places, 273/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 277 ms. Remains : 94/104 places, 273/284 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-10 finished in 484 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(G(p0)))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 98 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 96 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 96 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 93 transition count 268
Applied a total of 27 rules in 19 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 20:15:28] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 20:15:28] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 20:15:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 20:15:28] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:15:28] [INFO ] Invariant cache hit.
[2024-06-02 20:15:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:15:28] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/104 places, 268/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-11 finished in 243 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(G(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 101 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 98 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 96 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 96 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 93 transition count 268
Applied a total of 27 rules in 22 ms. Remains 93 /104 variables (removed 11) and now considering 268/284 (removed 16) transitions.
[2024-06-02 20:15:29] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:15:29] [INFO ] Invariant cache hit.
[2024-06-02 20:15:29] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:15:29] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:15:29] [INFO ] Invariant cache hit.
[2024-06-02 20:15:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:15:29] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 190 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/104 places, 268/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 92/104 places, 268/284 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-12 finished in 268 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(F((G(F(p1))&&p0)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 4 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 20:15:29] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 99 cols
[2024-06-02 20:15:29] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:15:29] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:15:29] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:15:29] [INFO ] Invariant cache hit.
[2024-06-02 20:15:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:15:29] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLFireability-14 finished in 465 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((F(G(p0))&&(F(p1)||X(p2)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 99 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 99 transition count 271
Applied a total of 11 rules in 6 ms. Remains 99 /104 variables (removed 5) and now considering 271/284 (removed 13) transitions.
[2024-06-02 20:15:29] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:15:29] [INFO ] Invariant cache hit.
[2024-06-02 20:15:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:15:29] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:15:29] [INFO ] Invariant cache hit.
[2024-06-02 20:15:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:15:29] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 271/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 98/104 places, 271/284 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-02-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2202 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2482 steps, run visited all 1 properties in 9 ms. (steps per millisecond=275 )
Probabilistic random walk after 2482 steps, saw 1168 distinct states, run finished after 9 ms. (steps per millisecond=275 ) properties seen :1
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 4 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 96 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 95 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 92 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 92 transition count 268
Applied a total of 16 rules in 15 ms. Remains 92 /98 variables (removed 6) and now considering 268/271 (removed 3) transitions.
[2024-06-02 20:15:30] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 92 cols
[2024-06-02 20:15:30] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:15:30] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:15:30] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:15:30] [INFO ] Invariant cache hit.
[2024-06-02 20:15:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:15:30] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 20:15:30] [INFO ] Redundant transitions in 5 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 20:15:30] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:15:30] [INFO ] Invariant cache hit.
[2024-06-02 20:15:30] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:15:32] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:15:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/326 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/327 variables, and 142 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8129 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/325 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 37/141 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 265/406 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:15:41] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:15:44] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:15:44] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/327 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 19415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 27682ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 27685ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/98 places, 268/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27884 ms. Remains : 92/98 places, 268/271 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 30744 steps (1965 resets) in 114 ms. (267 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Built C files in :
/tmp/ltsmin11787107800275114400
[2024-06-02 20:15:59] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-06-02 20:15:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:15:59] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-06-02 20:15:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:15:59] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-06-02 20:15:59] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:15:59] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11787107800275114400
Running compilation step : cd /tmp/ltsmin11787107800275114400;'/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 574 ms.
Running link step : cd /tmp/ltsmin11787107800275114400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11787107800275114400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11158740777514915184.hoa' '--buchi-type=spotba'
LTSmin run took 356 ms.
FORMULA FireWire-PT-02-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-02-LTLFireability-15 finished in 30371 ms.
All properties solved by simple procedures.
Total runtime 194853 ms.
BK_STOP 1717359360140
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-02"
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-02, 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-171734898700180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-02.tgz
mv FireWire-PT-02 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 '
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 ;