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.r512-smll-171654407200252.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 ltsminxred
Input is Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 19K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Apr 12 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:43 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 Peterson-PT-2-LTLFireability-00
FORMULA_NAME Peterson-PT-2-LTLFireability-01
FORMULA_NAME Peterson-PT-2-LTLFireability-02
FORMULA_NAME Peterson-PT-2-LTLFireability-03
FORMULA_NAME Peterson-PT-2-LTLFireability-04
FORMULA_NAME Peterson-PT-2-LTLFireability-05
FORMULA_NAME Peterson-PT-2-LTLFireability-06
FORMULA_NAME Peterson-PT-2-LTLFireability-07
FORMULA_NAME Peterson-PT-2-LTLFireability-08
FORMULA_NAME Peterson-PT-2-LTLFireability-09
FORMULA_NAME Peterson-PT-2-LTLFireability-10
FORMULA_NAME Peterson-PT-2-LTLFireability-11
FORMULA_NAME Peterson-PT-2-LTLFireability-12
FORMULA_NAME Peterson-PT-2-LTLFireability-13
FORMULA_NAME Peterson-PT-2-LTLFireability-14
FORMULA_NAME Peterson-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717269419226

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:17:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:17:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:17:01] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 19:17:01] [INFO ] Transformed 102 places.
[2024-06-01 19:17:01] [INFO ] Transformed 126 transitions.
[2024-06-01 19:17:01] [INFO ] Found NUPN structural information;
[2024-06-01 19:17:01] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-PT-2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 19 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 19:17:01] [INFO ] Computed 11 invariants in 17 ms
[2024-06-01 19:17:02] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-06-01 19:17:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:02] [INFO ] Invariant cache hit.
[2024-06-01 19:17:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:17:02] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:17:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:02] [INFO ] Invariant cache hit.
[2024-06-01 19:17:02] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 19 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 3 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:17:05] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 3 ms to minimize.
[2024-06-01 19:17:05] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
[2024-06-01 19:17:05] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:17:05] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:06] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8962 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:14] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6828 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 15893ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15916ms
Finished structural reductions in LTL mode , in 1 iterations and 16589 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 81 out of 102 places after structural reductions.
[2024-06-01 19:17:18] [INFO ] Flatten gal took : 45 ms
[2024-06-01 19:17:18] [INFO ] Flatten gal took : 21 ms
[2024-06-01 19:17:18] [INFO ] Input system was already deterministic with 126 transitions.
Support contains 80 out of 102 places (down from 81) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (8 resets) in 1298 ms. (30 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
[2024-06-01 19:17:19] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:19] [INFO ] Invariant cache hit.
[2024-06-01 19:17:19] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 69/93 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 69/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/96 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:17:19] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 120/216 variables, 96/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 22/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/222 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:17:19] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:17:19] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:17:20] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:17:20] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:17:20] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:17:20] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:17:20] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-06-01 19:17:20] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 8/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/222 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 246 constraints, problems are : Problem set: 0 solved, 4 unsolved in 851 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 69/93 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 69/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/96 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 120/216 variables, 96/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 22/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/222 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/222 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/222 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 250 constraints, problems are : Problem set: 0 solved, 4 unsolved in 409 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 1273ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 513 ms.
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 102 transition count 106
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 82 transition count 106
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 40 place count 82 transition count 89
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 74 place count 65 transition count 89
Applied a total of 74 rules in 31 ms. Remains 65 /102 variables (removed 37) and now considering 89/126 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 65/102 places, 89/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 9566 steps, run visited all 4 properties in 89 ms. (steps per millisecond=107 )
Probabilistic random walk after 9566 steps, saw 2423 distinct states, run finished after 94 ms. (steps per millisecond=101 ) properties seen :4
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))||F(G(p2))))'
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 102 transition count 110
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 86 transition count 110
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 32 place count 86 transition count 96
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 72 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 66 transition count 90
Applied a total of 72 rules in 18 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
[2024-06-01 19:17:22] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 66 cols
[2024-06-01 19:17:22] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 19:17:22] [INFO ] Implicit Places using invariants in 66 ms returned [55, 57, 58]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/102 places, 90/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 63/102 places, 90/126 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 450 ms.
Stack based approach found an accepted trace after 96 steps with 0 reset with depth 97 and stack size 97 in 3 ms.
FORMULA Peterson-PT-2-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-00 finished in 930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1&&F(G(p2))))))'
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:22] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 19:17:22] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 19:17:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 19:17:22] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:22] [INFO ] Invariant cache hit.
[2024-06-01 19:17:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:17:23] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:17:23] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:23] [INFO ] Invariant cache hit.
[2024-06-01 19:17:23] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 11 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:17:24] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:17:25] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:17:25] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:17:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:17:25] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:17:25] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:26] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8135 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:34] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6509 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 14676ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 14680ms
Finished structural reductions in LTL mode , in 1 iterations and 14914 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-01 finished in 15121 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 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 12 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2024-06-01 19:17:38] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 48 cols
[2024-06-01 19:17:38] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:17:38] [INFO ] Implicit Places using invariants in 69 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/102 places, 72/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 45/102 places, 72/126 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 177 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 15 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-02 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 70 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 17 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
[2024-06-01 19:17:38] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 50 cols
[2024-06-01 19:17:38] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:17:38] [INFO ] Implicit Places using invariants in 68 ms returned [39, 41, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/102 places, 74/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 47/102 places, 74/126 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-03
Product exploration explored 100000 steps with 25749 reset in 325 ms.
Product exploration explored 100000 steps with 25756 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 7 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
[2024-06-01 19:17:39] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 47 cols
[2024-06-01 19:17:39] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:17:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 19:17:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 19:17:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:17:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 19:17:40] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 19:17:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:17:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2024-06-01 19:17:40] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 6 transitions) in 8 ms.
[2024-06-01 19:17:40] [INFO ] Added : 43 causal constraints over 9 iterations in 108 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 12 out of 47 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 : 47/47 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-06-01 19:17:40] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-06-01 19:17:40] [INFO ] Invariant cache hit.
[2024-06-01 19:17:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 19:17:40] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-06-01 19:17:40] [INFO ] Invariant cache hit.
[2024-06-01 19:17:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:17:40] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-01 19:17:40] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2024-06-01 19:17:40] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-06-01 19:17:40] [INFO ] Invariant cache hit.
[2024-06-01 19:17:40] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 14 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 68/115 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 146 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2846 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-01 19:17:43] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 68/115 variables, 47/125 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 22/147 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 71/218 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-01 19:17:44] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 219 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2098 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 24/24 constraints]
After SMT, in 4961ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 4963ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5114 ms. Remains : 47/47 places, 74/74 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
[2024-06-01 19:17:45] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-06-01 19:17:45] [INFO ] Invariant cache hit.
[2024-06-01 19:17:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 19:17:45] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 19:17:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:17:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 19:17:45] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 19:17:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:17:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2024-06-01 19:17:45] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 6 transitions) in 6 ms.
[2024-06-01 19:17:46] [INFO ] Added : 33 causal constraints over 7 iterations in 66 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25720 reset in 128 ms.
Product exploration explored 100000 steps with 25708 reset in 210 ms.
Support contains 12 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 74/74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 45 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 39 transition count 66
Applied a total of 16 rules in 6 ms. Remains 39 /47 variables (removed 8) and now considering 66/74 (removed 8) transitions.
[2024-06-01 19:17:46] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 39 cols
[2024-06-01 19:17:46] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:17:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 19:17:46] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
[2024-06-01 19:17:46] [INFO ] Invariant cache hit.
[2024-06-01 19:17:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:17:46] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-01 19:17:46] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-06-01 19:17:46] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
[2024-06-01 19:17:46] [INFO ] Invariant cache hit.
[2024-06-01 19:17:46] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 19:17:46] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:17:46] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 60/99 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 22/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 19:17:47] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 122 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1966 ms.
Refiners :[Domain max(s): 39/39 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 60/99 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 22/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 63/185 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 185 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1039 ms.
Refiners :[Domain max(s): 39/39 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 14/14 constraints]
After SMT, in 3023ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3024ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/47 places, 66/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3180 ms. Remains : 39/47 places, 66/74 transitions.
Treatment of property Peterson-PT-2-LTLFireability-03 finished in 11405 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))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 48 place count 78 transition count 84
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 60 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 54 transition count 78
Applied a total of 96 rules in 17 ms. Remains 54 /102 variables (removed 48) and now considering 78/126 (removed 48) transitions.
[2024-06-01 19:17:49] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
// Phase 1: matrix 72 rows 54 cols
[2024-06-01 19:17:49] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:17:49] [INFO ] Implicit Places using invariants in 73 ms returned [43, 45, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/102 places, 78/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 51/102 places, 78/126 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-05
Product exploration explored 100000 steps with 2101 reset in 188 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-05 finished in 336 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(F((p0&&X(p1))))&&(F(p2)||G(p0)))))'
Support contains 30 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:50] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 19:17:50] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:17:50] [INFO ] Implicit Places using invariants in 85 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 86 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 12 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 185 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-06 finished in 588 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 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:50] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:50] [INFO ] Invariant cache hit.
[2024-06-01 19:17:50] [INFO ] Implicit Places using invariants in 70 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-07
Product exploration explored 100000 steps with 14942 reset in 192 ms.
Stack based approach found an accepted trace after 175 steps with 23 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-07 finished in 353 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)&&X(p1))) U p0))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:51] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:51] [INFO ] Invariant cache hit.
[2024-06-01 19:17:51] [INFO ] Implicit Places using invariants in 84 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 121 ms.
Stack based approach found an accepted trace after 117 steps with 0 reset with depth 118 and stack size 118 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-09 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:51] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:51] [INFO ] Invariant cache hit.
[2024-06-01 19:17:51] [INFO ] Implicit Places using invariants in 88 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
[2024-06-01 19:17:52] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2024-06-01 19:17:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 19:17:52] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 60/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 82/147 variables, 65/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 13/160 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 28/188 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/188 variables, 28/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/188 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/189 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 30/219 variables, 29/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/219 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 228 constraints, problems are : Problem set: 0 solved, 3 unsolved in 236 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 60/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 82/147 variables, 65/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 13/160 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/160 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/160 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/160 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 28/188 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 28/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/188 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/188 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 1/189 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/189 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/189 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/189 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 30/219 variables, 29/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/219 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/219 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/219 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 238 constraints, problems are : Problem set: 0 solved, 3 unsolved in 612 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 856ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 378 ms.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 99 transition count 92
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 65 transition count 92
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 68 place count 65 transition count 73
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 46 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 41 transition count 68
Applied a total of 116 rules in 9 ms. Remains 41 /99 variables (removed 58) and now considering 68/126 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 41/99 places, 68/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/3 properties
[2024-06-01 19:17:53] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 41 cols
[2024-06-01 19:17:53] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:17:53] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 22/25 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/71 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/85 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/93 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/93 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/93 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/94 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/94 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/94 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/103 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/103 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Domain max(s): 41/41 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 41/41 constraints, ReadFeed: 22/22 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, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 22/25 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/71 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/85 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/93 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/93 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/93 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/93 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/94 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/94 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/94 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/94 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/103 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/103 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Domain max(s): 41/41 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 41/41 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2856 steps, including 198 resets, run visited all 1 properties in 6 ms. (steps per millisecond=476 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 8 factoid took 215 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLFireability-10 finished in 2965 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&&X(p1))||G(p1)))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:54] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 19:17:54] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:17:54] [INFO ] Implicit Places using invariants in 93 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 94 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 39444 steps (8 resets) in 182 ms. (215 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 356 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:17:55] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2024-06-01 19:17:55] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 19:17:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 19:17:55] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:55] [INFO ] Invariant cache hit.
[2024-06-01 19:17:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:17:56] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:17:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:17:56] [INFO ] Invariant cache hit.
[2024-06-01 19:17:56] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:17:58] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 249 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7454 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 123/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 372 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4627 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 12101ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 12104ms
Finished structural reductions in LTL mode , in 1 iterations and 12322 ms. Remains : 99/99 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 26831 steps (5 resets) in 36 ms. (725 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 350 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 138 ms.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:18:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:18:09] [INFO ] Invariant cache hit.
[2024-06-01 19:18:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 19:18:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:18:09] [INFO ] Invariant cache hit.
[2024-06-01 19:18:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:18:09] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:18:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:18:09] [INFO ] Invariant cache hit.
[2024-06-01 19:18:09] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:18:12] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 249 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7452 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 123/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 372 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4511 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 12000ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 12002ms
Finished structural reductions in LTL mode , in 1 iterations and 12226 ms. Remains : 99/99 places, 126/126 transitions.
Treatment of property Peterson-PT-2-LTLFireability-11 finished in 27542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U p1) U p2)||X(F(p2)))))'
Support contains 1 out of 102 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 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 70 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 66 place count 69 transition count 76
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 100 place count 52 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 47 transition count 71
Applied a total of 110 rules in 11 ms. Remains 47 /102 variables (removed 55) and now considering 71/126 (removed 55) transitions.
[2024-06-01 19:18:21] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
// Phase 1: matrix 65 rows 47 cols
[2024-06-01 19:18:21] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:18:21] [INFO ] Implicit Places using invariants in 67 ms returned [35, 37, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/102 places, 71/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 44/102 places, 71/126 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-13
Product exploration explored 100000 steps with 2715 reset in 108 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-13 finished in 306 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)&&X(X(G(p1)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:18:22] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 19:18:22] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:18:22] [INFO ] Implicit Places using invariants in 83 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-2-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 105 ms.
Entered a terminal (fully accepting) state of product in 344 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-14 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:18:22] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:18:22] [INFO ] Invariant cache hit.
[2024-06-01 19:18:22] [INFO ] Implicit Places using invariants in 90 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Peterson-PT-2-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-15 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
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&&X(p1))||G(p1)))))'
Found a Shortening insensitive property : Peterson-PT-2-LTLFireability-11
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 70 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 66 place count 69 transition count 75
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 6 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
[2024-06-01 19:18:23] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 45 cols
[2024-06-01 19:18:23] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 19:18:23] [INFO ] Implicit Places using invariants in 58 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 42/102 places, 69/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 68 ms. Remains : 42/102 places, 69/126 transitions.
Running random walk in product with property : Peterson-PT-2-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 136 ms.
Product exploration explored 100000 steps with 4 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 132 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 5613 steps (1 resets) in 50 ms. (110 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 353 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-06-01 19:18:24] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 42 cols
[2024-06-01 19:18:24] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 19:18:24] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 19:18:24] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-06-01 19:18:24] [INFO ] Invariant cache hit.
[2024-06-01 19:18:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:18:24] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 19:18:24] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-06-01 19:18:24] [INFO ] Invariant cache hit.
[2024-06-01 19:18:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 63/105 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 22/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 127 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1811 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 63/105 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 22/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 66/193 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 193 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1194 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 13/13 constraints]
After SMT, in 3019ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3020ms
Finished structural reductions in LTL mode , in 1 iterations and 3173 ms. Remains : 42/42 places, 69/69 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 16272 steps (4 resets) in 154 ms. (104 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 360 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-06-01 19:18:28] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-06-01 19:18:28] [INFO ] Invariant cache hit.
[2024-06-01 19:18:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 19:18:28] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-06-01 19:18:28] [INFO ] Invariant cache hit.
[2024-06-01 19:18:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:18:29] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 19:18:29] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-06-01 19:18:29] [INFO ] Invariant cache hit.
[2024-06-01 19:18:29] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 63/105 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 22/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 127 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1797 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 63/105 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 22/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 66/193 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 193 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1133 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 13/13 constraints]
After SMT, in 2944ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2945ms
Finished structural reductions in LTL mode , in 1 iterations and 3079 ms. Remains : 42/42 places, 69/69 transitions.
Treatment of property Peterson-PT-2-LTLFireability-11 finished in 9173 ms.
[2024-06-01 19:18:32] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:18:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 19:18:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 126 transitions and 384 arcs took 3 ms.
Total runtime 91119 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Peterson-PT-2-LTLFireability-03
FORMULA Peterson-PT-2-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717269516655

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Peterson-PT-2-LTLFireability-03
ltl formula formula --ltl=/tmp/1877/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 102 places, 126 transitions and 384 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1877/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1877/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1877/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1877/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name Peterson-PT-2-LTLFireability-11
ltl formula formula --ltl=/tmp/1877/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 102 places, 126 transitions and 384 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1877/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1877/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1877/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1877/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 103 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 103, there are 151 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~104!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 507
pnml2lts-mc( 0/ 4): unique transitions count: 1524
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 110
pnml2lts-mc( 0/ 4): - claim success count: 514
pnml2lts-mc( 0/ 4): - cum. max stack depth: 514
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 514 states 1549 transitions, fanout: 3.014
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51400, Transitions per second: 154900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.1 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="Peterson-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-PT-2, 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 r512-smll-171654407200252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;