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-171734898900251.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-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K 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 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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-11-LTLCardinality-00
FORMULA_NAME FireWire-PT-11-LTLCardinality-01
FORMULA_NAME FireWire-PT-11-LTLCardinality-02
FORMULA_NAME FireWire-PT-11-LTLCardinality-03
FORMULA_NAME FireWire-PT-11-LTLCardinality-04
FORMULA_NAME FireWire-PT-11-LTLCardinality-05
FORMULA_NAME FireWire-PT-11-LTLCardinality-06
FORMULA_NAME FireWire-PT-11-LTLCardinality-07
FORMULA_NAME FireWire-PT-11-LTLCardinality-08
FORMULA_NAME FireWire-PT-11-LTLCardinality-09
FORMULA_NAME FireWire-PT-11-LTLCardinality-10
FORMULA_NAME FireWire-PT-11-LTLCardinality-11
FORMULA_NAME FireWire-PT-11-LTLCardinality-12
FORMULA_NAME FireWire-PT-11-LTLCardinality-13
FORMULA_NAME FireWire-PT-11-LTLCardinality-14
FORMULA_NAME FireWire-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717362567125

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 21:09:28] [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 21:09:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:09:28] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 21:09:28] [INFO ] Transformed 169 places.
[2024-06-02 21:09:28] [INFO ] Transformed 508 transitions.
[2024-06-02 21:09:28] [INFO ] Found NUPN structural information;
[2024-06-02 21:09:28] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 182 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 3 formulas.
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 443/443 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 167 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 167 transition count 439
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 10 place count 167 transition count 433
Applied a total of 10 rules in 36 ms. Remains 167 /169 variables (removed 2) and now considering 433/443 (removed 10) transitions.
[2024-06-02 21:09:28] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
// Phase 1: matrix 401 rows 167 cols
[2024-06-02 21:09:28] [INFO ] Computed 10 invariants in 14 ms
[2024-06-02 21:09:28] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-02 21:09:28] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
[2024-06-02 21:09:28] [INFO ] Invariant cache hit.
[2024-06-02 21:09:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:09:29] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [63, 114]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 561 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/169 places, 433/443 transitions.
Applied a total of 0 rules in 13 ms. Remains 165 /165 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 165/169 places, 433/443 transitions.
Support contains 28 out of 165 places after structural reductions.
[2024-06-02 21:09:29] [INFO ] Flatten gal took : 57 ms
[2024-06-02 21:09:29] [INFO ] Flatten gal took : 28 ms
[2024-06-02 21:09:29] [INFO ] Input system was already deterministic with 433 transitions.
RANDOM walk for 40000 steps (1070 resets) in 1232 ms. (32 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (213 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (232 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (217 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (220 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
[2024-06-02 21:09:30] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
// Phase 1: matrix 401 rows 165 cols
[2024-06-02 21:09:30] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 21:09:30] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 122/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/154 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:09:30] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 55/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 19/565 variables, 11/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/566 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/566 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 232 constraints, problems are : Problem set: 0 solved, 4 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 165/165 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 122/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/154 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 55/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 19/565 variables, 11/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 236 constraints, problems are : Problem set: 0 solved, 4 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 165/165 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1138ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 428 ms.
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 433/433 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 165 transition count 430
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 165 transition count 424
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 159 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 156 transition count 432
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 156 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 156 transition count 423
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 156 transition count 426
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 42 place count 152 transition count 422
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 45 place count 152 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 151 transition count 418
Applied a total of 46 rules in 106 ms. Remains 151 /165 variables (removed 14) and now considering 418/433 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 151/165 places, 418/433 transitions.
RANDOM walk for 40000 steps (1277 resets) in 1150 ms. (34 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (257 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2024-06-02 21:09:32] [INFO ] Flow matrix only has 383 transitions (discarded 35 similar events)
// Phase 1: matrix 383 rows 151 cols
[2024-06-02 21:09:32] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 21:09:32] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/54 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/89 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 262/351 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/352 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 160/512 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/512 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/512 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/512 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/513 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/513 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/513 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/532 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/534 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/534 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/534 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/54 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 35/89 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 262/351 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/352 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 160/512 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/512 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/512 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/512 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/513 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/513 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/513 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 19/532 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/534 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/534 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/534 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 363ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 612 steps, including 192 resets, run visited all 1 properties in 2 ms. (steps per millisecond=306 )
Parikh walk visited 1 properties in 7 ms.
FORMULA FireWire-PT-11-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 21 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 4 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 21:09:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 164 cols
[2024-06-02 21:09:32] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:09:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:09:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:09:32] [INFO ] Invariant cache hit.
[2024-06-02 21:09:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:09:33] [INFO ] Implicit Places using invariants and state equation in 289 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 391 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 399 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-11-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-11-LTLCardinality-00 finished in 1096 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 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Applied a total of 0 rules in 3 ms. Remains 165 /165 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2024-06-02 21:09:33] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
// Phase 1: matrix 401 rows 165 cols
[2024-06-02 21:09:33] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:09:33] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:09:33] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
[2024-06-02 21:09:33] [INFO ] Invariant cache hit.
[2024-06-02 21:09:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:09:34] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [163]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/165 places, 433/433 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 164/165 places, 433/433 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-03 finished in 460 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)))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 7 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 21:09:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 164 cols
[2024-06-02 21:09:34] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:09:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:09:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:09:34] [INFO ] Invariant cache hit.
[2024-06-02 21:09:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:09:34] [INFO ] Implicit Places using invariants and state equation in 285 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 370 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 381 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-04 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 8 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 21:09:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:09:34] [INFO ] Invariant cache hit.
[2024-06-02 21:09:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 21:09:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:09:34] [INFO ] Invariant cache hit.
[2024-06-02 21:09:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:09:35] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-07 finished in 580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((F(p1)&&X(G(p2)))))))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 5 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 21:09:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:09:35] [INFO ] Invariant cache hit.
[2024-06-02 21:09:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:09:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:09:35] [INFO ] Invariant cache hit.
[2024-06-02 21:09:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:09:35] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-08 finished in 570 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))||G(p1)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 164 transition count 427
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 159 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 158 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 158 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 18 place count 155 transition count 434
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 24 place count 155 transition count 428
Applied a total of 24 rules in 46 ms. Remains 155 /165 variables (removed 10) and now considering 428/433 (removed 5) transitions.
[2024-06-02 21:09:36] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
// Phase 1: matrix 389 rows 155 cols
[2024-06-02 21:09:36] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:09:36] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:09:36] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 21:09:36] [INFO ] Invariant cache hit.
[2024-06-02 21:09:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:09:36] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [153]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 352 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/165 places, 428/433 transitions.
Applied a total of 0 rules in 13 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 154/165 places, 428/433 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-11
Product exploration explored 100000 steps with 1 reset in 190 ms.
Product exploration explored 100000 steps with 0 reset in 101 ms.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Detected a total of 13/154 stabilizing places and 28/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 9520 steps (284 resets) in 86 ms. (109 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 428/428 transitions.
Applied a total of 0 rules in 11 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 21:09:37] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
// Phase 1: matrix 389 rows 154 cols
[2024-06-02 21:09:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:09:38] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-02 21:09:38] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 21:09:38] [INFO ] Invariant cache hit.
[2024-06-02 21:09:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:09:38] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-06-02 21:09:38] [INFO ] Redundant transitions in 32 ms returned []
Running 421 sub problems to find dead transitions.
[2024-06-02 21:09:38] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 21:09:38] [INFO ] Invariant cache hit.
[2024-06-02 21:09:38] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 21:09:40] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:09:40] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:09:40] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:09:40] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:09:41] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:09:41] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2024-06-02 21:09:42] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 21:09:43] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 388/542 variables, 154/169 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 21:09:50] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:09:50] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:09:50] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (OVERLAPS) 0/542 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/543 variables, and 228 constraints, problems are : Problem set: 0 solved, 421 unsolved in 21687 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/542 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 421/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 21:10:20] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:10:20] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 16 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/542 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/543 variables, and 651 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 13/13 constraints]
After SMT, in 52215ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 52222ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52811 ms. Remains : 154/154 places, 428/428 transitions.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Detected a total of 13/154 stabilizing places and 28/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 19417 steps (600 resets) in 99 ms. (194 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 244 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 80 ms.
Product exploration explored 100000 steps with 11 reset in 190 ms.
Built C files in :
/tmp/ltsmin7850510831681693268
[2024-06-02 21:10:31] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2024-06-02 21:10:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:31] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2024-06-02 21:10:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:31] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2024-06-02 21:10:31] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:31] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7850510831681693268
Running compilation step : cd /tmp/ltsmin7850510831681693268;'/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 1387 ms.
Running link step : cd /tmp/ltsmin7850510831681693268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7850510831681693268;'/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/stateBased14264649645573524951.hoa' '--buchi-type=spotba'
LTSmin run took 1154 ms.
FORMULA FireWire-PT-11-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-11-LTLCardinality-11 finished in 58530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)||p0))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 5 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 21:10:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 164 cols
[2024-06-02 21:10:34] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 21:10:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 21:10:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:10:34] [INFO ] Invariant cache hit.
[2024-06-02 21:10:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:10:34] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:10:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:10:34] [INFO ] Invariant cache hit.
[2024-06-02 21:10:34] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:10:37] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:10:37] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:10:38] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:10:38] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:10:38] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:10:38] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:10:39] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/562 variables, 164/179 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 237 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23838 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/562 variables, 164/179 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 430/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:11:12] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
[2024-06-02 21:11:13] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:11:24] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/563 variables, and 669 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, ReadFeed: 57/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 10/10 constraints]
After SMT, in 54200ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 54208ms
Starting structural reductions in LTL mode, iteration 1 : 164/165 places, 431/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54590 ms. Remains : 164/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 3 reset in 167 ms.
Computed a total of 20 stabilizing places and 31 stable transitions
Computed a total of 20 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 27329 steps (719 resets) in 66 ms. (407 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 431/431 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 164 transition count 427
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 14 place count 157 transition count 436
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 20 place count 157 transition count 430
Applied a total of 20 rules in 30 ms. Remains 157 /164 variables (removed 7) and now considering 430/431 (removed 1) transitions.
[2024-06-02 21:11:30] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
// Phase 1: matrix 391 rows 157 cols
[2024-06-02 21:11:30] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:11:30] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 21:11:30] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:11:30] [INFO ] Invariant cache hit.
[2024-06-02 21:11:30] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:11:30] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-06-02 21:11:30] [INFO ] Redundant transitions in 3 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 21:11:30] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:11:30] [INFO ] Invariant cache hit.
[2024-06-02 21:11:30] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:11:33] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:11:33] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:11:33] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:11:33] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:11:34] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:11:34] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:11:34] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:11:34] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-06-02 21:11:35] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 24138 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:12:08] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-06-02 21:12:08] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 1/548 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 665 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 11/11 constraints]
After SMT, in 54537ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54541ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/164 places, 430/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55030 ms. Remains : 157/164 places, 430/431 transitions.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 23132 steps (694 resets) in 54 ms. (420 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 50 ms.
Product exploration explored 100000 steps with 1 reset in 46 ms.
Built C files in :
/tmp/ltsmin14839482600367085744
[2024-06-02 21:12:25] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2024-06-02 21:12:25] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:12:25] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2024-06-02 21:12:25] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:12:25] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2024-06-02 21:12:25] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:12:25] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14839482600367085744
Running compilation step : cd /tmp/ltsmin14839482600367085744;'/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 1014 ms.
Running link step : cd /tmp/ltsmin14839482600367085744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14839482600367085744;'/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/stateBased8472718132422466108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 430/430 transitions.
Applied a total of 0 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-06-02 21:12:40] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:12:40] [INFO ] Invariant cache hit.
[2024-06-02 21:12:41] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:12:41] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:12:41] [INFO ] Invariant cache hit.
[2024-06-02 21:12:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:12:41] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-02 21:12:41] [INFO ] Redundant transitions in 2 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 21:12:41] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:12:41] [INFO ] Invariant cache hit.
[2024-06-02 21:12:41] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:12:45] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:12:45] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 23803 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:13:18] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:13:19] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
SMT process timed out in 54132ms, After SMT, problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54514 ms. Remains : 157/157 places, 430/430 transitions.
Built C files in :
/tmp/ltsmin15553674049539727614
[2024-06-02 21:13:35] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2024-06-02 21:13:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:13:35] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2024-06-02 21:13:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:13:35] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2024-06-02 21:13:35] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:13:35] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15553674049539727614
Running compilation step : cd /tmp/ltsmin15553674049539727614;'/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 1042 ms.
Running link step : cd /tmp/ltsmin15553674049539727614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15553674049539727614;'/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/stateBased17418579060724967922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 21:13:50] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:13:50] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:13:50] [INFO ] Time to serialize gal into /tmp/LTL9279682507975500060.gal : 4 ms
[2024-06-02 21:13:50] [INFO ] Time to serialize properties into /tmp/LTL15611761275780807892.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9279682507975500060.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17275515387111930334.hoa' '-atoms' '/tmp/LTL15611761275780807892.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p131==0)||(p116==1))")||(F("(((p54==0)||(p135==1))||(p167==1))"))))))
Formula 0 simplified : XF(!"((p131==0)||(p116==1))" & G!"(((p54==0)||(p135==1))||(p167==1))")
Detected timeout of ITS tools.
[2024-06-02 21:14:20] [INFO ] Flatten gal took : 42 ms
[2024-06-02 21:14:20] [INFO ] Applying decomposition
[2024-06-02 21:14:20] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4712709552481782149.txt' '-o' '/tmp/graph4712709552481782149.bin' '-w' '/tmp/graph4712709552481782149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4712709552481782149.bin' '-l' '-1' '-v' '-w' '/tmp/graph4712709552481782149.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:14:21] [INFO ] Decomposing Gal with order
[2024-06-02 21:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:14:21] [INFO ] Removed a total of 656 redundant transitions.
[2024-06-02 21:14:21] [INFO ] Flatten gal took : 67 ms
[2024-06-02 21:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 12 ms.
[2024-06-02 21:14:21] [INFO ] Time to serialize gal into /tmp/LTL1668752683011357979.gal : 5 ms
[2024-06-02 21:14:21] [INFO ] Time to serialize properties into /tmp/LTL8388851369236169151.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1668752683011357979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8388851369236169151.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i9.u40.p131==0)||(i4.u34.p116==1))")||(F("(((i1.u17.p54==0)||(i8.i0.u42.p135==1))||(i8.i1.u52.p167==1))"))))))
Formula 0 simplified : XF(!"((i9.u40.p131==0)||(i4.u34.p116==1))" & G!"(((i1.u17.p54==0)||(i8.i0.u42.p135==1))||(i8.i1.u52.p167==1))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-11-LTLCardinality-12 finished in 241678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)||p0))))'
Found a Lengthening insensitive property : FireWire-PT-11-LTLCardinality-12
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 165 transition count 429
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 161 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 160 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 160 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 16 place count 157 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 157 transition count 433
Applied a total of 19 rules in 21 ms. Remains 157 /165 variables (removed 8) and now considering 433/433 (removed 0) transitions.
[2024-06-02 21:14:36] [INFO ] Flow matrix only has 394 transitions (discarded 39 similar events)
// Phase 1: matrix 394 rows 157 cols
[2024-06-02 21:14:36] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 21:14:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 21:14:36] [INFO ] Flow matrix only has 394 transitions (discarded 39 similar events)
[2024-06-02 21:14:36] [INFO ] Invariant cache hit.
[2024-06-02 21:14:36] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:14:36] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-02 21:14:36] [INFO ] Flow matrix only has 394 transitions (discarded 39 similar events)
[2024-06-02 21:14:36] [INFO ] Invariant cache hit.
[2024-06-02 21:14:36] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 21:14:39] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 13 ms to minimize.
[2024-06-02 21:14:39] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:14:39] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:14:40] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-06-02 21:14:40] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:14:40] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:14:41] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 393/550 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 432 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 232 constraints, problems are : Problem set: 0 solved, 432 unsolved in 24002 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 393/550 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 432/663 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 21:15:13] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:15:14] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 1/551 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 666 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 9/9 constraints]
After SMT, in 54407ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 54413ms
Starting structural reductions in LI_LTL mode, iteration 1 : 157/165 places, 433/433 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54777 ms. Remains : 157/165 places, 433/433 transitions.
Running random walk in product with property : FireWire-PT-11-LTLCardinality-12
Product exploration explored 100000 steps with 20 reset in 41 ms.
Product exploration explored 100000 steps with 3 reset in 48 ms.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 33387 steps (989 resets) in 118 ms. (280 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 433/433 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 430
Applied a total of 3 rules in 19 ms. Remains 157 /157 variables (removed 0) and now considering 430/433 (removed 3) transitions.
[2024-06-02 21:15:31] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
// Phase 1: matrix 391 rows 157 cols
[2024-06-02 21:15:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:15:32] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:15:32] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:15:32] [INFO ] Invariant cache hit.
[2024-06-02 21:15:32] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:15:32] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 21:15:32] [INFO ] Redundant transitions in 2 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 21:15:32] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:15:32] [INFO ] Invariant cache hit.
[2024-06-02 21:15:32] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 5 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:15:36] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:15:36] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 23921 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:16:10] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:16:10] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
SMT process timed out in 54239ms, After SMT, problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54243ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/157 places, 430/433 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54611 ms. Remains : 157/157 places, 430/433 transitions.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 8227 steps (234 resets) in 27 ms. (293 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 8 reset in 45 ms.
Product exploration explored 100000 steps with 12 reset in 48 ms.
Built C files in :
/tmp/ltsmin16808065423857097794
[2024-06-02 21:16:27] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2024-06-02 21:16:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:27] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2024-06-02 21:16:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:27] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2024-06-02 21:16:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:27] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16808065423857097794
Running compilation step : cd /tmp/ltsmin16808065423857097794;'/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 1057 ms.
Running link step : cd /tmp/ltsmin16808065423857097794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16808065423857097794;'/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/stateBased6615178612430298632.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 430/430 transitions.
Applied a total of 0 rules in 16 ms. Remains 157 /157 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-06-02 21:16:42] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:16:42] [INFO ] Invariant cache hit.
[2024-06-02 21:16:42] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 21:16:42] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:16:42] [INFO ] Invariant cache hit.
[2024-06-02 21:16:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:16:42] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-06-02 21:16:42] [INFO ] Redundant transitions in 3 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 21:16:42] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 21:16:42] [INFO ] Invariant cache hit.
[2024-06-02 21:16:42] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:16:45] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:16:45] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:16:45] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:16:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:16:46] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:16:46] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:16:46] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:16:46] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:16:47] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 23838 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:17:19] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:17:20] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 1/548 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 665 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 11/11 constraints]
After SMT, in 54186ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54659 ms. Remains : 157/157 places, 430/430 transitions.
Built C files in :
/tmp/ltsmin13317253062987273982
[2024-06-02 21:17:37] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2024-06-02 21:17:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:17:37] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2024-06-02 21:17:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:17:37] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2024-06-02 21:17:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:17:37] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13317253062987273982
Running compilation step : cd /tmp/ltsmin13317253062987273982;'/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 1055 ms.
Running link step : cd /tmp/ltsmin13317253062987273982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13317253062987273982;'/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/stateBased12471773652219098173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 21:17:52] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:17:52] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:17:52] [INFO ] Time to serialize gal into /tmp/LTL4598004062103378092.gal : 6 ms
[2024-06-02 21:17:52] [INFO ] Time to serialize properties into /tmp/LTL3852411712504422689.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4598004062103378092.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12710454839304537021.hoa' '-atoms' '/tmp/LTL3852411712504422689.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p131==0)||(p116==1))")||(F("(((p54==0)||(p135==1))||(p167==1))"))))))
Formula 0 simplified : XF(!"((p131==0)||(p116==1))" & G!"(((p54==0)||(p135==1))||(p167==1))")
Detected timeout of ITS tools.
[2024-06-02 21:18:22] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:18:22] [INFO ] Applying decomposition
[2024-06-02 21:18:22] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7615778497679144569.txt' '-o' '/tmp/graph7615778497679144569.bin' '-w' '/tmp/graph7615778497679144569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7615778497679144569.bin' '-l' '-1' '-v' '-w' '/tmp/graph7615778497679144569.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:18:22] [INFO ] Decomposing Gal with order
[2024-06-02 21:18:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:18:22] [INFO ] Removed a total of 627 redundant transitions.
[2024-06-02 21:18:22] [INFO ] Flatten gal took : 31 ms
[2024-06-02 21:18:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 11 ms.
[2024-06-02 21:18:22] [INFO ] Time to serialize gal into /tmp/LTL12092568326960188261.gal : 20 ms
[2024-06-02 21:18:22] [INFO ] Time to serialize properties into /tmp/LTL3732567151503181319.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12092568326960188261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3732567151503181319.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i10.u47.p131==0)||(i7.u34.p116==1))")||(F("(((u9.p54==0)||(i8.u39.p135==1))||(i10.u47.p167==1))"))))))
Formula 0 simplified : XF(!"((i10.u47.p131==0)||(i7.u34.p116==1))" & G!"(((u9.p54==0)||(i8.u39.p135==1))||(i10.u47.p167==1))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-11-LTLCardinality-12 finished in 241296 ms.
[2024-06-02 21:18:37] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12645786815393188419
[2024-06-02 21:18:37] [INFO ] Computing symmetric may disable matrix : 433 transitions.
[2024-06-02 21:18:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:18:37] [INFO ] Computing symmetric may enable matrix : 433 transitions.
[2024-06-02 21:18:37] [INFO ] Applying decomposition
[2024-06-02 21:18:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:18:37] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9042451338414061366.txt' '-o' '/tmp/graph9042451338414061366.bin' '-w' '/tmp/graph9042451338414061366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9042451338414061366.bin' '-l' '-1' '-v' '-w' '/tmp/graph9042451338414061366.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:18:37] [INFO ] Decomposing Gal with order
[2024-06-02 21:18:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:18:37] [INFO ] Computing Do-Not-Accords matrix : 433 transitions.
[2024-06-02 21:18:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:18:37] [INFO ] Removed a total of 679 redundant transitions.
[2024-06-02 21:18:37] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12645786815393188419
Running compilation step : cd /tmp/ltsmin12645786815393188419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
[2024-06-02 21:18:37] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:18:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 20 ms.
[2024-06-02 21:18:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality10434327299681380238.gal : 3 ms
[2024-06-02 21:18:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality11507029780627812326.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10434327299681380238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11507029780627812326.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i10.u46.p131==0)||(i5.u40.p116==1))")||(F("(((i2.u11.p54==0)||(i9.u47.p135==1))||(i8.i1.u57.p167==1))"))))))
Formula 0 simplified : XF(!"((i10.u46.p131==0)||(i5.u40.p116==1))" & G!"(((i2.u11.p54==0)||(i9.u47.p135==1))||(i8.i1.u57.p167==1))")
Compilation finished in 1058 ms.
Running link step : cd /tmp/ltsmin12645786815393188419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12645786815393188419;'/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' '--ltl' 'X([]((<>((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 6888 ms.
FORMULA FireWire-PT-11-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 557360 ms.

BK_STOP 1717363125657

--------------------
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-11"
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-11, 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-171734898900251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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