Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898800211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898800211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717360417190

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 20:33:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:33:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:33:38] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 20:33:38] [INFO ] Transformed 116 places.
[2024-06-02 20:33:38] [INFO ] Transformed 368 transitions.
[2024-06-02 20:33:38] [INFO ] Found NUPN structural information;
[2024-06-02 20:33:38] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 312/312 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 306
Applied a total of 6 rules in 25 ms. Remains 116 /116 variables (removed 0) and now considering 306/312 (removed 6) transitions.
[2024-06-02 20:33:38] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 20:33:38] [INFO ] Computed 9 invariants in 22 ms
[2024-06-02 20:33:39] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-02 20:33:39] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:33:39] [INFO ] Invariant cache hit.
[2024-06-02 20:33:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:33:39] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 20:33:39] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:33:39] [INFO ] Invariant cache hit.
[2024-06-02 20:33:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:33:41] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 7 ms to minimize.
[2024-06-02 20:33:41] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:33:43] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:33:43] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:33:43] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 293 constraints, problems are : Problem set: 0 solved, 305 unsolved in 16100 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 305/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 598 constraints, problems are : Problem set: 0 solved, 305 unsolved in 20409 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
After SMT, in 36811ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 36832ms
Starting structural reductions in LTL mode, iteration 1 : 116/116 places, 306/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37366 ms. Remains : 116/116 places, 306/312 transitions.
Support contains 28 out of 116 places after structural reductions.
[2024-06-02 20:34:16] [INFO ] Flatten gal took : 57 ms
[2024-06-02 20:34:16] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:34:16] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 25 out of 116 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (2040 resets) in 1420 ms. (28 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4003 steps (43 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (59 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (49 resets) in 71 ms. (55 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (47 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (72 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (39 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (57 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (57 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (48 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (68 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (44 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (41 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (50 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (57 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (52 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2024-06-02 20:34:17] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:34:17] [INFO ] Invariant cache hit.
[2024-06-02 20:34:17] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 85/104 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 12/116 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:34:17] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 279/395 variables, 116/242 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 40/282 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/396 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/396 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 283 constraints, problems are : Problem set: 0 solved, 15 unsolved in 673 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 85/104 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:34:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 12/116 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 279/395 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 40/288 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 15/303 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 1/396 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/396 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 304 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1490 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 7/7 constraints]
After SMT, in 2179ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 14 properties in 3236 ms.
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 306/306 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 112 transition count 298
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 109 transition count 305
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 109 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 109 transition count 294
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 109 transition count 296
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 108 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 108 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 107 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 106 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 36 place count 106 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 105 transition count 290
Applied a total of 38 rules in 101 ms. Remains 105 /116 variables (removed 11) and now considering 290/306 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 105/116 places, 290/306 transitions.
RANDOM walk for 40000 steps (2502 resets) in 929 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (609 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2026 steps, run visited all 1 properties in 16 ms. (steps per millisecond=126 )
Probabilistic random walk after 2026 steps, saw 1116 distinct states, run finished after 20 ms. (steps per millisecond=101 ) properties seen :1
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 5 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 20:34:23] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 20:34:23] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 20:34:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 20:34:23] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:23] [INFO ] Invariant cache hit.
[2024-06-02 20:34:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:34:23] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 276 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-06-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-06-LTLCardinality-00 finished in 961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 109 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 108 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 107 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 107 transition count 298
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 106 transition count 298
Applied a total of 24 rules in 37 ms. Remains 106 /116 variables (removed 10) and now considering 298/306 (removed 8) transitions.
[2024-06-02 20:34:24] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 106 cols
[2024-06-02 20:34:24] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:34:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:34:24] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 20:34:24] [INFO ] Invariant cache hit.
[2024-06-02 20:34:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:34:24] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 214 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/116 places, 298/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 104/116 places, 298/306 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 151 ms.
Product exploration explored 100000 steps with 0 reset in 88 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (2428 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (591 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (598 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2013 steps, run visited all 2 properties in 16 ms. (steps per millisecond=125 )
Probabilistic random walk after 2013 steps, saw 1099 distinct states, run finished after 16 ms. (steps per millisecond=125 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 298/298 transitions.
Applied a total of 0 rules in 10 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 20:34:25] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 104 cols
[2024-06-02 20:34:25] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 20:34:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:34:25] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 20:34:25] [INFO ] Invariant cache hit.
[2024-06-02 20:34:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:34:25] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 20:34:25] [INFO ] Redundant transitions in 12 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 20:34:25] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 20:34:25] [INFO ] Invariant cache hit.
[2024-06-02 20:34:25] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:34:26] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:34:26] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:34:27] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:34:27] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:34:27] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:34:28] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/369 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:34:30] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/370 variables, and 156 constraints, problems are : Problem set: 0 solved, 295 unsolved in 10582 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:34:37] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/369 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 295/452 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:34:41] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:34:41] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/370 variables, and 454 constraints, problems are : Problem set: 0 solved, 295 unsolved in 16096 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 10/10 constraints]
After SMT, in 26879ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 26890ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27110 ms. Remains : 104/104 places, 298/298 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (2427 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (636 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (625 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2013 steps, run visited all 2 properties in 16 ms. (steps per millisecond=125 )
Probabilistic random walk after 2013 steps, saw 1099 distinct states, run finished after 17 ms. (steps per millisecond=118 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Built C files in :
/tmp/ltsmin4195103182587626671
[2024-06-02 20:34:53] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-06-02 20:34:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:34:53] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-06-02 20:34:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:34:53] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-06-02 20:34:53] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:34:53] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4195103182587626671
Running compilation step : cd /tmp/ltsmin4195103182587626671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 842 ms.
Running link step : cd /tmp/ltsmin4195103182587626671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4195103182587626671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13113295607176882004.hoa' '--buchi-type=spotba'
LTSmin run took 2565 ms.
FORMULA FireWire-PT-06-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-06-LTLCardinality-01 finished in 33048 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(((p1 U p2)&&p0))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 110 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 110 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 109 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 108 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 108 transition count 301
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 107 transition count 301
Applied a total of 20 rules in 41 ms. Remains 107 /116 variables (removed 9) and now considering 301/306 (removed 5) transitions.
[2024-06-02 20:34:57] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
// Phase 1: matrix 268 rows 107 cols
[2024-06-02 20:34:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:34:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:34:57] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
[2024-06-02 20:34:57] [INFO ] Invariant cache hit.
[2024-06-02 20:34:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:34:57] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 193 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/116 places, 301/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 105/116 places, 301/306 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-02 finished in 335 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(((!p1 U (p2||G(!p1)))&&p0)))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 7 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 20:34:57] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 20:34:57] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:34:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:34:57] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:57] [INFO ] Invariant cache hit.
[2024-06-02 20:34:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:34:57] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 241 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 114/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-04 finished in 401 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 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 20:34:58] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:58] [INFO ] Invariant cache hit.
[2024-06-02 20:34:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:34:58] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:58] [INFO ] Invariant cache hit.
[2024-06-02 20:34:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:34:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 238 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-06-LTLCardinality-05 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 3 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 20:34:58] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:58] [INFO ] Invariant cache hit.
[2024-06-02 20:34:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 20:34:58] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:58] [INFO ] Invariant cache hit.
[2024-06-02 20:34:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:34:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 244 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-06-LTLCardinality-06 finished in 599 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)&&G(p2))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 20:34:59] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:59] [INFO ] Invariant cache hit.
[2024-06-02 20:34:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:34:59] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:34:59] [INFO ] Invariant cache hit.
[2024-06-02 20:34:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:34:59] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 221 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-07 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 110 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 110 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 109 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 108 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 20 place count 108 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 107 transition count 299
Applied a total of 22 rules in 26 ms. Remains 107 /116 variables (removed 9) and now considering 299/306 (removed 7) transitions.
[2024-06-02 20:34:59] [INFO ] Flow matrix only has 267 transitions (discarded 32 similar events)
// Phase 1: matrix 267 rows 107 cols
[2024-06-02 20:34:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:34:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:34:59] [INFO ] Flow matrix only has 267 transitions (discarded 32 similar events)
[2024-06-02 20:34:59] [INFO ] Invariant cache hit.
[2024-06-02 20:34:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:34:59] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 245 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/116 places, 299/306 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 280 ms. Remains : 105/116 places, 299/306 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-09 finished in 378 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(X(p0))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 20:35:00] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 20:35:00] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 20:35:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:35:00] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:00] [INFO ] Invariant cache hit.
[2024-06-02 20:35:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:35:00] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 246 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 0 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 248 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 127 ms.
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1968 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (547 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2116140 steps, run timeout after 3001 ms. (steps per millisecond=705 ) properties seen :0 out of 1
Probabilistic random walk after 2116140 steps, saw 365734 distinct states, run finished after 3003 ms. (steps per millisecond=704 ) properties seen :0
[2024-06-02 20:35:04] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 20:35:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:35:04] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/390 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/390 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/391 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/391 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 304/304 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 113 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 110 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 108 transition count 303
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 108 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 108 transition count 295
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 108 transition count 295
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 29 place count 105 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 104 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 103 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 33 place count 103 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 102 transition count 289
Applied a total of 35 rules in 24 ms. Remains 102 /113 variables (removed 11) and now considering 289/304 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 102/113 places, 289/304 transitions.
RANDOM walk for 31123 steps (1882 resets) in 52 ms. (587 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:35:04] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:04] [INFO ] Invariant cache hit.
[2024-06-02 20:35:04] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 20:35:04] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:04] [INFO ] Invariant cache hit.
[2024-06-02 20:35:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:35:05] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:35:05] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:05] [INFO ] Invariant cache hit.
[2024-06-02 20:35:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:35:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:35:06] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:35:06] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:35:06] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:35:06] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:35:07] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:35:07] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12918 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:35:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:35:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42233ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42236ms
Finished structural reductions in LTL mode , in 1 iterations and 42515 ms. Remains : 113/113 places, 304/304 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1970 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (540 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2159669 steps, run timeout after 3001 ms. (steps per millisecond=719 ) properties seen :0 out of 1
Probabilistic random walk after 2159669 steps, saw 373349 distinct states, run finished after 3001 ms. (steps per millisecond=719 ) properties seen :0
[2024-06-02 20:35:50] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:50] [INFO ] Invariant cache hit.
[2024-06-02 20:35:50] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/390 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:35:50] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:35:50] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 277/388 variables, 111/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/391 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/391 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 304/304 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 113 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 110 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 108 transition count 303
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 108 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 108 transition count 295
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 108 transition count 295
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 29 place count 105 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 104 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 103 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 33 place count 103 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 102 transition count 289
Applied a total of 35 rules in 24 ms. Remains 102 /113 variables (removed 11) and now considering 289/304 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 102/113 places, 289/304 transitions.
RANDOM walk for 40000 steps (2491 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (622 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1972 steps, run visited all 1 properties in 7 ms. (steps per millisecond=281 )
Probabilistic random walk after 1972 steps, saw 1071 distinct states, run finished after 7 ms. (steps per millisecond=281 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 113 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 113 transition count 314
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 113 transition count 308
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 19 ms. Remains 113 /113 variables (removed 0) and now considering 308/304 (removed -4) transitions.
[2024-06-02 20:35:52] [INFO ] Redundant transitions in 4 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 20:35:52] [INFO ] Flow matrix only has 279 transitions (discarded 29 similar events)
// Phase 1: matrix 279 rows 113 cols
[2024-06-02 20:35:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:35:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:35:53] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 20:35:53] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:35:54] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:35:55] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:35:55] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 10/17 constraints. Problems are: Problem set: 8 solved, 299 unsolved
[2024-06-02 20:35:55] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/18 constraints. Problems are: Problem set: 8 solved, 299 unsolved
[2024-06-02 20:35:56] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 278/391 variables, 113/132 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 42/174 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/174 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/175 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/175 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/175 constraints. Problems are: Problem set: 8 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 175 constraints, problems are : Problem set: 8 solved, 299 unsolved in 13891 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 8 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 12/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 278/391 variables, 113/132 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 42/174 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 299/473 constraints. Problems are: Problem set: 8 solved, 299 unsolved
[2024-06-02 20:36:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:36:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 2/475 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/475 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/476 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/476 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/476 constraints. Problems are: Problem set: 8 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 476 constraints, problems are : Problem set: 8 solved, 299 unsolved in 23578 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 299/307 constraints, Known Traps: 14/14 constraints]
After SMT, in 37646ms problems are : Problem set: 8 solved, 299 unsolved
Search for dead transitions found 8 dead transitions in 37649ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/113 places, 300/304 transitions.
Graph (complete) has 585 edges and 113 vertex of which 108 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 108 /113 variables (removed 5) and now considering 300/300 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/113 places, 300/304 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37700 ms. Remains : 108/113 places, 300/304 transitions.
Built C files in :
/tmp/ltsmin16767159127725857498
[2024-06-02 20:36:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16767159127725857498
Running compilation step : cd /tmp/ltsmin16767159127725857498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin16767159127725857498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16767159127725857498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3322793417210921183.hoa' '--buchi-type=spotba'
LTSmin run took 335 ms.
FORMULA FireWire-PT-06-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-06-LTLCardinality-10 finished in 90888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 109 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 108 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 107 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 107 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 106 transition count 298
Applied a total of 24 rules in 20 ms. Remains 106 /116 variables (removed 10) and now considering 298/306 (removed 8) transitions.
[2024-06-02 20:36:30] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 106 cols
[2024-06-02 20:36:30] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:36:31] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:36:31] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 20:36:31] [INFO ] Invariant cache hit.
[2024-06-02 20:36:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:36:31] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 193 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/116 places, 298/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 105/116 places, 298/306 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 44 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 10164 steps (605 resets) in 28 ms. (350 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 298/298 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 20:36:31] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 20:36:31] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:36:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:36:31] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 20:36:31] [INFO ] Invariant cache hit.
[2024-06-02 20:36:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:36:31] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 20:36:31] [INFO ] Redundant transitions in 5 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 20:36:31] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 20:36:31] [INFO ] Invariant cache hit.
[2024-06-02 20:36:31] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:36:32] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:36:32] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-02 20:36:32] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:36:33] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:36:33] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2024-06-02 20:36:33] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:36:34] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:36:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/370 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:36:36] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2024-06-02 20:36:36] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 161 constraints, problems are : Problem set: 0 solved, 295 unsolved in 10871 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 265/370 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 295/456 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:36:51] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/370 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 457 constraints, problems are : Problem set: 0 solved, 295 unsolved in 19449 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints]
After SMT, in 30497ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 30500ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30713 ms. Remains : 105/105 places, 298/298 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 9372 steps (581 resets) in 26 ms. (347 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 45 ms.
Product exploration explored 100000 steps with 2 reset in 100 ms.
Built C files in :
/tmp/ltsmin14928104826715307488
[2024-06-02 20:37:02] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-06-02 20:37:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:37:02] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-06-02 20:37:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:37:02] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-06-02 20:37:02] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:37:02] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14928104826715307488
Running compilation step : cd /tmp/ltsmin14928104826715307488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 651 ms.
Running link step : cd /tmp/ltsmin14928104826715307488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14928104826715307488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14511800180763269358.hoa' '--buchi-type=spotba'
LTSmin run took 636 ms.
FORMULA FireWire-PT-06-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-06-LTLCardinality-12 finished in 33267 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((G(p0)||(X(F(!p0))&&p1)))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 109 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 108 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 107 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 107 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 106 transition count 298
Applied a total of 24 rules in 21 ms. Remains 106 /116 variables (removed 10) and now considering 298/306 (removed 8) transitions.
[2024-06-02 20:37:04] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 106 cols
[2024-06-02 20:37:04] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:37:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:37:04] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 20:37:04] [INFO ] Invariant cache hit.
[2024-06-02 20:37:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:37:04] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 194 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/116 places, 298/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 104/116 places, 298/306 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-13 finished in 288 ms.
All properties solved by simple procedures.
Total runtime 206194 ms.

BK_STOP 1717360624609

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898800211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-06.tgz
mv FireWire-PT-06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;