About the Execution of ITS-Tools for FireWire-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1493.479 | 189953.00 | 249071.00 | 604.70 | FFFFTTTFFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898800195.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-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898800195
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 89K 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-04-LTLCardinality-00
FORMULA_NAME FireWire-PT-04-LTLCardinality-01
FORMULA_NAME FireWire-PT-04-LTLCardinality-02
FORMULA_NAME FireWire-PT-04-LTLCardinality-03
FORMULA_NAME FireWire-PT-04-LTLCardinality-04
FORMULA_NAME FireWire-PT-04-LTLCardinality-05
FORMULA_NAME FireWire-PT-04-LTLCardinality-06
FORMULA_NAME FireWire-PT-04-LTLCardinality-07
FORMULA_NAME FireWire-PT-04-LTLCardinality-08
FORMULA_NAME FireWire-PT-04-LTLCardinality-09
FORMULA_NAME FireWire-PT-04-LTLCardinality-10
FORMULA_NAME FireWire-PT-04-LTLCardinality-11
FORMULA_NAME FireWire-PT-04-LTLCardinality-12
FORMULA_NAME FireWire-PT-04-LTLCardinality-13
FORMULA_NAME FireWire-PT-04-LTLCardinality-14
FORMULA_NAME FireWire-PT-04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717359787234
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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 20:23:08] [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:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:23:08] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-02 20:23:08] [INFO ] Transformed 113 places.
[2024-06-02 20:23:08] [INFO ] Transformed 364 transitions.
[2024-06-02 20:23:08] [INFO ] Found NUPN structural information;
[2024-06-02 20:23:08] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA FireWire-PT-04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 308/308 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 112 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 306
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 8 place count 112 transition count 300
Applied a total of 8 rules in 31 ms. Remains 112 /113 variables (removed 1) and now considering 300/308 (removed 8) transitions.
[2024-06-02 20:23:08] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 112 cols
[2024-06-02 20:23:08] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 20:23:09] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-02 20:23:09] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:23:09] [INFO ] Invariant cache hit.
[2024-06-02 20:23:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:23:09] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [61, 105, 110]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 500 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/113 places, 300/308 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 557 ms. Remains : 109/113 places, 300/308 transitions.
Support contains 19 out of 109 places after structural reductions.
[2024-06-02 20:23:09] [INFO ] Flatten gal took : 51 ms
[2024-06-02 20:23:09] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:23:09] [INFO ] Input system was already deterministic with 300 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (2169 resets) in 1578 ms. (25 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40003 steps (607 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (580 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (547 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (575 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (605 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (527 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
[2024-06-02 20:23:10] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 20:23:10] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 20:23:10] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/103 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 270/373 variables, 103/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/379 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 3/382 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/383 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/383 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 154 constraints, problems are : Problem set: 0 solved, 6 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/103 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:23:11] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 11 ms to minimize.
[2024-06-02 20:23:11] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:23:11] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 270/373 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 6/379 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/382 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/383 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/383 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 163 constraints, problems are : Problem set: 0 solved, 6 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1323ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1104 ms.
Support contains 10 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 300/300 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 108 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 108 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 107 transition count 295
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 2 with 6 rules applied. Total rules applied 13 place count 104 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 104 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 104 transition count 293
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 104 transition count 294
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 33 place count 100 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 100 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 99 transition count 288
Applied a total of 36 rules in 77 ms. Remains 99 /109 variables (removed 10) and now considering 288/300 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 99/109 places, 288/300 transitions.
RANDOM walk for 40000 steps (2649 resets) in 786 ms. (50 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (666 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (609 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (618 resets) in 112 ms. (354 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (659 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
[2024-06-02 20:23:13] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
// Phase 1: matrix 259 rows 99 cols
[2024-06-02 20:23:13] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:23:13] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 249/330 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/356 variables, 16/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/357 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/358 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 144 constraints, problems are : Problem set: 0 solved, 3 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 249/330 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/356 variables, 16/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/358 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/358 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 147 constraints, problems are : Problem set: 0 solved, 3 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 288/288 transitions.
Applied a total of 0 rules in 12 ms. Remains 99 /99 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 99/99 places, 288/288 transitions.
RANDOM walk for 40000 steps (2498 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (647 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (648 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (688 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 238443 steps, run visited all 3 properties in 478 ms. (steps per millisecond=498 )
Probabilistic random walk after 238443 steps, saw 53020 distinct states, run finished after 481 ms. (steps per millisecond=495 ) properties seen :3
Computed a total of 5 stabilizing places and 7 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' '!(F(G(p0)))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 300/300 transitions.
Reduce places removed 1 places and 1 transitions.
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 6 place count 105 transition count 306
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 12 place count 105 transition count 300
Applied a total of 12 rules in 19 ms. Remains 105 /109 variables (removed 4) and now considering 300/300 (removed 0) transitions.
[2024-06-02 20:23:14] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
// Phase 1: matrix 267 rows 105 cols
[2024-06-02 20:23:14] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:23:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 20:23:14] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 20:23:14] [INFO ] Invariant cache hit.
[2024-06-02 20:23:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:23:14] [INFO ] Implicit Places using invariants and state equation in 160 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 241 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/109 places, 300/300 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 104/109 places, 300/300 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLCardinality-00 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 300/300 transitions.
Applied a total of 0 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-02 20:23:15] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 20:23:15] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:23:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 20:23:15] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:23:15] [INFO ] Invariant cache hit.
[2024-06-02 20:23:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:23:15] [INFO ] Implicit Places using invariants and state equation in 485 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 598 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/300 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 610 ms. Remains : 108/109 places, 300/300 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-04-LTLCardinality-01
Stuttering criterion allowed to conclude after 11 steps with 2 reset in 2 ms.
FORMULA FireWire-PT-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLCardinality-01 finished in 769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((X(G(p2))||p1))))))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 300/300 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-02 20:23:15] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:23:15] [INFO ] Invariant cache hit.
[2024-06-02 20:23:15] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 20:23:15] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:23:15] [INFO ] Invariant cache hit.
[2024-06-02 20:23:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:23:16] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-06-02 20:23:16] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:23:16] [INFO ] Invariant cache hit.
[2024-06-02 20:23:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 20:23:17] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:23:17] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:23:18] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:23:18] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/382 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 20:23:20] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 1/383 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (OVERLAPS) 0/383 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 159 constraints, problems are : Problem set: 0 solved, 299 unsolved in 13604 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/382 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 299/457 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 20:23:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 20:23:40] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 460 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 7/7 constraints]
After SMT, in 43859ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 43865ms
Finished structural reductions in LTL mode , in 1 iterations and 44103 ms. Remains : 109/109 places, 300/300 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-04-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLCardinality-02 finished in 44310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 300/300 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-02 20:24:00] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:24:00] [INFO ] Invariant cache hit.
[2024-06-02 20:24:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:24:00] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:24:00] [INFO ] Invariant cache hit.
[2024-06-02 20:24:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:24:00] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/300 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 242 ms. Remains : 108/109 places, 300/300 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-04-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2246 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (575 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 575119 steps, run visited all 1 properties in 705 ms. (steps per millisecond=815 )
Probabilistic random walk after 575119 steps, saw 104685 distinct states, run finished after 705 ms. (steps per millisecond=815 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-04-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-04-LTLCardinality-07 finished in 1755 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 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 300/300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 297
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 2 with 6 rules applied. Total rules applied 10 place count 103 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 103 transition count 298
Applied a total of 16 rules in 31 ms. Remains 103 /109 variables (removed 6) and now considering 298/300 (removed 2) transitions.
[2024-06-02 20:24:01] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 103 cols
[2024-06-02 20:24:01] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:24:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:24:02] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:24:02] [INFO ] Invariant cache hit.
[2024-06-02 20:24:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:24:02] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 188 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/109 places, 298/300 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 102/109 places, 298/300 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLCardinality-10 finished in 388 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 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 300/300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 297
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 2 with 6 rules applied. Total rules applied 10 place count 103 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 103 transition count 298
Applied a total of 16 rules in 19 ms. Remains 103 /109 variables (removed 6) and now considering 298/300 (removed 2) transitions.
[2024-06-02 20:24:02] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:24:02] [INFO ] Invariant cache hit.
[2024-06-02 20:24:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:24:02] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:24:02] [INFO ] Invariant cache hit.
[2024-06-02 20:24:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:24:02] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 188 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/109 places, 298/300 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 102/109 places, 298/300 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLCardinality-13
Product exploration explored 100000 steps with 2 reset in 192 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26667 steps (1755 resets) in 69 ms. (380 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 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 15 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 20:24:03] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 20:24:03] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 20:24:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:24:03] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:24:03] [INFO ] Invariant cache hit.
[2024-06-02 20:24:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:24:03] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 20:24:03] [INFO ] Redundant transitions in 16 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 20:24:03] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:24:03] [INFO ] Invariant cache hit.
[2024-06-02 20:24:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:24:04] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:24:04] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:24:04] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:24:05] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:24:08] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:24:08] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:24:08] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13910 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 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/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:24:21] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:24:22] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 23509 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37628ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37632ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37883 ms. Remains : 102/102 places, 298/298 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2559 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (622 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 102986 steps, run visited all 1 properties in 133 ms. (steps per millisecond=774 )
Probabilistic random walk after 102986 steps, saw 19917 distinct states, run finished after 133 ms. (steps per millisecond=774 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 43 ms.
Product exploration explored 100000 steps with 3 reset in 40 ms.
Built C files in :
/tmp/ltsmin8588407513113960198
[2024-06-02 20:24:42] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-06-02 20:24:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:24:42] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-06-02 20:24:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:24:42] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-06-02 20:24:42] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:24:42] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8588407513113960198
Running compilation step : cd /tmp/ltsmin8588407513113960198;'/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 782 ms.
Running link step : cd /tmp/ltsmin8588407513113960198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8588407513113960198;'/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/stateBased6895059769871812994.hoa' '--buchi-type=spotba'
LTSmin run took 516 ms.
FORMULA FireWire-PT-04-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-04-LTLCardinality-13 finished in 41114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 300/300 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-02 20:24:43] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 109 cols
[2024-06-02 20:24:43] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:24:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:24:43] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:24:43] [INFO ] Invariant cache hit.
[2024-06-02 20:24:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:24:43] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/300 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 108/109 places, 300/300 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2185 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (546 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2075 steps, run visited all 1 properties in 6 ms. (steps per millisecond=345 )
Probabilistic random walk after 2075 steps, saw 1147 distinct states, run finished after 6 ms. (steps per millisecond=345 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 300/300 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-02 20:24:44] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2024-06-02 20:24:44] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 20:24:44] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:24:44] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:24:44] [INFO ] Invariant cache hit.
[2024-06-02 20:24:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:24:44] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-06-02 20:24:44] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2024-06-02 20:24:44] [INFO ] Invariant cache hit.
[2024-06-02 20:24:44] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 20:24:46] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:24:46] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:24:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 20:24:54] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/382 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/382 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 156 constraints, problems are : Problem set: 0 solved, 299 unsolved in 15642 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 299/454 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 20:25:04] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:25:05] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:25:06] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/382 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 299 unsolved in 26566 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 7/7 constraints]
After SMT, in 42416ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42420ms
Finished structural reductions in LTL mode , in 1 iterations and 42642 ms. Remains : 108/108 places, 300/300 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2228 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (547 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2075 steps, run visited all 1 properties in 7 ms. (steps per millisecond=296 )
Probabilistic random walk after 2075 steps, saw 1147 distinct states, run finished after 7 ms. (steps per millisecond=296 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 47 ms.
Product exploration explored 100000 steps with 1 reset in 46 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 300/300 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 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 1 place count 108 transition count 300
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 107 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 107 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 107 transition count 312
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 107 transition count 306
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 24 ms. Remains 107 /108 variables (removed 1) and now considering 306/300 (removed -6) transitions.
[2024-06-02 20:25:28] [INFO ] Redundant transitions in 4 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-02 20:25:28] [INFO ] Flow matrix only has 273 transitions (discarded 33 similar events)
// Phase 1: matrix 273 rows 107 cols
[2024-06-02 20:25:28] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:25:28] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:25:29] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 20:25:29] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-02 20:25:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-02 20:25:30] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:25:30] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:25:30] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/10 constraints. Problems are: Problem set: 6 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 299 unsolved
Problem TDEAD278 is UNSAT
At refinement iteration 4 (OVERLAPS) 272/379 variables, 107/117 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 42/159 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/159 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/160 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/160 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/160 constraints. Problems are: Problem set: 7 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 160 constraints, problems are : Problem set: 7 solved, 298 unsolved in 12927 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 7 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 4/106 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/10 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/378 variables, 106/116 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 42/158 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 298/456 constraints. Problems are: Problem set: 7 solved, 298 unsolved
[2024-06-02 20:25:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:25:45] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:25:46] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 3/459 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/459 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 1/379 variables, 1/460 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/460 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 11 (OVERLAPS) 1/380 variables, 1/461 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/461 constraints. Problems are: Problem set: 7 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 461 constraints, problems are : Problem set: 7 solved, 298 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 298/305 constraints, Known Traps: 9/9 constraints]
After SMT, in 43121ms problems are : Problem set: 7 solved, 298 unsolved
Search for dead transitions found 7 dead transitions in 43124ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/108 places, 299/300 transitions.
Graph (complete) has 570 edges and 107 vertex of which 103 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 103 /107 variables (removed 4) and now considering 299/299 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/108 places, 299/300 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43169 ms. Remains : 103/108 places, 299/300 transitions.
Built C files in :
/tmp/ltsmin13680118806599052974
[2024-06-02 20:26:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13680118806599052974
Running compilation step : cd /tmp/ltsmin13680118806599052974;'/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 488 ms.
Running link step : cd /tmp/ltsmin13680118806599052974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13680118806599052974;'/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/stateBased12231105833644891006.hoa' '--buchi-type=spotba'
LTSmin run took 5128 ms.
FORMULA FireWire-PT-04-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-04-LTLCardinality-14 finished in 93690 ms.
All properties solved by simple procedures.
Total runtime 188792 ms.
BK_STOP 1717359977187
--------------------
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-04"
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-04, 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-171734898800195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-04.tgz
mv FireWire-PT-04 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 '
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 ;