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.r553-tall-171734901300267.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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-13-LTLCardinality-00
FORMULA_NAME FireWire-PT-13-LTLCardinality-01
FORMULA_NAME FireWire-PT-13-LTLCardinality-02
FORMULA_NAME FireWire-PT-13-LTLCardinality-03
FORMULA_NAME FireWire-PT-13-LTLCardinality-04
FORMULA_NAME FireWire-PT-13-LTLCardinality-05
FORMULA_NAME FireWire-PT-13-LTLCardinality-06
FORMULA_NAME FireWire-PT-13-LTLCardinality-07
FORMULA_NAME FireWire-PT-13-LTLCardinality-08
FORMULA_NAME FireWire-PT-13-LTLCardinality-09
FORMULA_NAME FireWire-PT-13-LTLCardinality-10
FORMULA_NAME FireWire-PT-13-LTLCardinality-11
FORMULA_NAME FireWire-PT-13-LTLCardinality-12
FORMULA_NAME FireWire-PT-13-LTLCardinality-13
FORMULA_NAME FireWire-PT-13-LTLCardinality-14
FORMULA_NAME FireWire-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717355689128

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:14:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:14:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:14:50] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-02 19:14:50] [INFO ] Transformed 205 places.
[2024-06-02 19:14:50] [INFO ] Transformed 610 transitions.
[2024-06-02 19:14:50] [INFO ] Found NUPN structural information;
[2024-06-02 19:14:50] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 207 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 2 formulas.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-13-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-13-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 200 transition count 532
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 200 transition count 532
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 200 transition count 530
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 197 transition count 521
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 197 transition count 521
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 195 transition count 517
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 195 transition count 517
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 193 transition count 511
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 193 transition count 511
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 191 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 191 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 189 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 189 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 187 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 187 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 185 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 185 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 183 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 183 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 181 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 181 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 180 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 180 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 179 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 179 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 179 transition count 471
Applied a total of 60 rules in 104 ms. Remains 179 /205 variables (removed 26) and now considering 471/542 (removed 71) transitions.
[2024-06-02 19:14:50] [INFO ] Flow matrix only has 439 transitions (discarded 32 similar events)
// Phase 1: matrix 439 rows 179 cols
[2024-06-02 19:14:50] [INFO ] Computed 10 invariants in 20 ms
[2024-06-02 19:14:51] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-02 19:14:51] [INFO ] Flow matrix only has 439 transitions (discarded 32 similar events)
[2024-06-02 19:14:51] [INFO ] Invariant cache hit.
[2024-06-02 19:14:51] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:14:51] [INFO ] Implicit Places using invariants and state equation in 340 ms returned [21, 82, 136]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 650 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/205 places, 471/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 176/205 places, 471/542 transitions.
Support contains 16 out of 176 places after structural reductions.
[2024-06-02 19:14:51] [INFO ] Flatten gal took : 75 ms
[2024-06-02 19:14:51] [INFO ] Flatten gal took : 51 ms
[2024-06-02 19:14:51] [INFO ] Input system was already deterministic with 471 transitions.
RANDOM walk for 40000 steps (1117 resets) in 1600 ms. (24 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40001 steps (246 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (215 resets) in 97 ms. (408 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (242 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2024-06-02 19:14:52] [INFO ] Flow matrix only has 439 transitions (discarded 32 similar events)
// Phase 1: matrix 439 rows 176 cols
[2024-06-02 19:14:52] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 19:14:52] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/161 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 426/587 variables, 161/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 58/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 27/614 variables, 15/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/615 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/615 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 615/615 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/161 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:14:52] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 426/587 variables, 161/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 58/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:14:53] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 27/614 variables, 15/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/614 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/615 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/615 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/615 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 615/615 variables, and 249 constraints, problems are : Problem set: 0 solved, 2 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 910ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 140 ms.
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 471/471 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 176 transition count 468
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 176 transition count 465
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 172 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 172 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 172 transition count 462
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 169 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 166 transition count 465
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 166 transition count 459
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 33 place count 166 transition count 456
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 166 transition count 462
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 45 place count 163 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 51 place count 163 transition count 450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 162 transition count 449
Applied a total of 52 rules in 129 ms. Remains 162 /176 variables (removed 14) and now considering 449/471 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 162/176 places, 449/471 transitions.
RANDOM walk for 40000 steps (1297 resets) in 756 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (271 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (265 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 821824 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 2
Probabilistic random walk after 821824 steps, saw 200743 distinct states, run finished after 3013 ms. (steps per millisecond=272 ) properties seen :0
[2024-06-02 19:14:56] [INFO ] Flow matrix only has 412 transitions (discarded 37 similar events)
// Phase 1: matrix 412 rows 162 cols
[2024-06-02 19:14:56] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:14:56] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 128/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 391/523 variables, 132/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/570 variables, 26/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 60/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/571 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/574 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/574 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 128/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 391/523 variables, 132/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/570 variables, 26/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 60/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:14:57] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/571 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/574 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/574 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 669ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 449/449 transitions.
Applied a total of 0 rules in 20 ms. Remains 162 /162 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 162/162 places, 449/449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 449/449 transitions.
Applied a total of 0 rules in 10 ms. Remains 162 /162 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2024-06-02 19:14:57] [INFO ] Flow matrix only has 412 transitions (discarded 37 similar events)
[2024-06-02 19:14:57] [INFO ] Invariant cache hit.
[2024-06-02 19:14:57] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 19:14:57] [INFO ] Flow matrix only has 412 transitions (discarded 37 similar events)
[2024-06-02 19:14:57] [INFO ] Invariant cache hit.
[2024-06-02 19:14:58] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 19:14:58] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-06-02 19:14:58] [INFO ] Redundant transitions in 25 ms returned []
Running 443 sub problems to find dead transitions.
[2024-06-02 19:14:58] [INFO ] Flow matrix only has 412 transitions (discarded 37 similar events)
[2024-06-02 19:14:58] [INFO ] Invariant cache hit.
[2024-06-02 19:14:58] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 19:15:00] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:15:00] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:15:00] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:15:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:15:00] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:15:01] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:15:01] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:15:02] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:15:02] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 19:15:04] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (OVERLAPS) 412/574 variables, 162/179 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 19:15:08] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:15:09] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:15:10] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:15:10] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 19:15:15] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:15:16] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 245 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 412/574 variables, 162/185 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 60/245 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 443/688 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 19:15:39] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 689 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 17/17 constraints]
After SMT, in 60526ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60972 ms. Remains : 162/162 places, 449/449 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 162 vertex of which 29 / 162 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 136 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 135 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 135 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 134 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 133 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 133 transition count 247
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 133 transition count 232
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 124 transition count 229
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 124 transition count 229
Applied a total of 46 rules in 49 ms. Remains 124 /162 variables (removed 38) and now considering 229/449 (removed 220) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:15:58] [INFO ] Flow matrix only has 227 transitions (discarded 2 similar events)
// Phase 1: matrix 227 rows 124 cols
[2024-06-02 19:15:58] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:15:58] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:15:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:15:59] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:15:59] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 19:15:59] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 1
[2024-06-02 19:15:59] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:15:59] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 449 ms.
Computed a total of 34 stabilizing places and 77 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(X(F(p0))))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 471/471 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 172 transition count 463
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 172 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 172 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 170 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 170 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 168 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 168 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 167 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 166 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 166 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 165 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 165 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 164 transition count 443
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 164 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 163 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 163 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 162 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 162 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 161 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 160 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 160 transition count 434
Applied a total of 33 rules in 16 ms. Remains 160 /176 variables (removed 16) and now considering 434/471 (removed 37) transitions.
[2024-06-02 19:15:59] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 160 cols
[2024-06-02 19:15:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:15:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:15:59] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 19:15:59] [INFO ] Invariant cache hit.
[2024-06-02 19:15:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:15:59] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-02 19:15:59] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 19:15:59] [INFO ] Invariant cache hit.
[2024-06-02 19:15:59] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 19:16:02] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:16:02] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:16:02] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:16:03] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:16:03] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:16:03] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:16:03] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:16:03] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 433 unsolved in 23887 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 433/666 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 19:16:36] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:16:36] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 433 unsolved
SMT process timed out in 54256ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 54261ms
Starting structural reductions in LTL mode, iteration 1 : 160/176 places, 434/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54679 ms. Remains : 160/176 places, 434/471 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLCardinality-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-13-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLCardinality-01 finished in 54910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 471/471 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 465
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 173 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 171 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 171 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 169 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 169 transition count 455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 168 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 167 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 166 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 166 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 165 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 165 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 164 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 164 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 163 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 163 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 162 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 162 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 161 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 436
Applied a total of 31 rules in 13 ms. Remains 161 /176 variables (removed 15) and now considering 436/471 (removed 35) transitions.
[2024-06-02 19:16:54] [INFO ] Flow matrix only has 404 transitions (discarded 32 similar events)
// Phase 1: matrix 404 rows 161 cols
[2024-06-02 19:16:54] [INFO ] Computed 7 invariants in 16 ms
[2024-06-02 19:16:54] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 19:16:54] [INFO ] Flow matrix only has 404 transitions (discarded 32 similar events)
[2024-06-02 19:16:54] [INFO ] Invariant cache hit.
[2024-06-02 19:16:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:16:54] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2024-06-02 19:16:54] [INFO ] Flow matrix only has 404 transitions (discarded 32 similar events)
[2024-06-02 19:16:54] [INFO ] Invariant cache hit.
[2024-06-02 19:16:54] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 19:16:57] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:16:57] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:16:57] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:16:57] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (OVERLAPS) 403/564 variables, 161/175 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (OVERLAPS) 1/565 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 435 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 233 constraints, problems are : Problem set: 0 solved, 435 unsolved in 23907 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (OVERLAPS) 403/564 variables, 161/175 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 435/667 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 19:17:32] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:17:33] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 435 unsolved
SMT process timed out in 54284ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 54287ms
Starting structural reductions in LTL mode, iteration 1 : 161/176 places, 436/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54821 ms. Remains : 161/176 places, 436/471 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 261 ms.
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Computed a total of 20 stabilizing places and 45 stable transitions
Computed a total of 20 stabilizing places and 45 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-13-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-13-LTLCardinality-03 finished in 55535 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(p1)))) U p2))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 471/471 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 172 transition count 463
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 172 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 172 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 170 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 170 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 168 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 168 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 167 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 166 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 166 transition count 448
Applied a total of 21 rules in 6 ms. Remains 166 /176 variables (removed 10) and now considering 448/471 (removed 23) transitions.
[2024-06-02 19:17:49] [INFO ] Flow matrix only has 416 transitions (discarded 32 similar events)
// Phase 1: matrix 416 rows 166 cols
[2024-06-02 19:17:49] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:17:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 19:17:49] [INFO ] Flow matrix only has 416 transitions (discarded 32 similar events)
[2024-06-02 19:17:49] [INFO ] Invariant cache hit.
[2024-06-02 19:17:50] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 19:17:50] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2024-06-02 19:17:50] [INFO ] Flow matrix only has 416 transitions (discarded 32 similar events)
[2024-06-02 19:17:50] [INFO ] Invariant cache hit.
[2024-06-02 19:17:50] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:17:53] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:17:53] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:17:53] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:17:53] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:17:54] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:17:54] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:17:54] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:17:54] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 415/581 variables, 166/181 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 59/240 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (OVERLAPS) 1/582 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 9 (OVERLAPS) 0/582 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 241 constraints, problems are : Problem set: 0 solved, 447 unsolved in 25042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 415/581 variables, 166/181 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 59/240 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 447/687 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:18:26] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:18:28] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:18:29] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 9 (OVERLAPS) 1/582 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 691 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 11/11 constraints]
After SMT, in 55432ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 55436ms
Starting structural reductions in LTL mode, iteration 1 : 166/176 places, 448/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55774 ms. Remains : 166/176 places, 448/471 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLCardinality-04 finished in 56006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 471/471 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 175 transition count 468
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 468
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 169 transition count 460
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 169 transition count 460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 169 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 167 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 167 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 165 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 165 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 164 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 164 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 163 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 163 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 162 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 162 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 161 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 161 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 160 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 160 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 159 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 159 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 158 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 158 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 157 transition count 431
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 157 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 154 transition count 428
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 151 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 151 transition count 428
Applied a total of 55 rules in 69 ms. Remains 151 /176 variables (removed 25) and now considering 428/471 (removed 43) transitions.
[2024-06-02 19:18:45] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
// Phase 1: matrix 389 rows 151 cols
[2024-06-02 19:18:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:18:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 19:18:45] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 19:18:45] [INFO ] Invariant cache hit.
[2024-06-02 19:18:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:18:46] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 19:18:46] [INFO ] Redundant transitions in 4 ms returned []
Running 421 sub problems to find dead transitions.
[2024-06-02 19:18:46] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 19:18:46] [INFO ] Invariant cache hit.
[2024-06-02 19:18:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 19:18:47] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:18:47] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:18:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:18:48] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:18:49] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:18:49] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:18:49] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:18:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/538 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 19:18:56] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:18:56] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 1/539 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 9 (OVERLAPS) 0/539 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/540 variables, and 229 constraints, problems are : Problem set: 0 solved, 421 unsolved in 25189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/538 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 421/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 1/539 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 19:19:32] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/540 variables, and 651 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 16/16 constraints]
After SMT, in 55509ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 55515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/176 places, 428/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55921 ms. Remains : 151/176 places, 428/471 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLCardinality-07
Stuttering criterion allowed to conclude after 18 steps with 2 reset in 0 ms.
FORMULA FireWire-PT-13-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLCardinality-07 finished in 56014 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(p1)&&p0)))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 471/471 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 174 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 173 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 172 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 172 transition count 463
Applied a total of 8 rules in 7 ms. Remains 172 /176 variables (removed 4) and now considering 463/471 (removed 8) transitions.
[2024-06-02 19:19:41] [INFO ] Flow matrix only has 431 transitions (discarded 32 similar events)
// Phase 1: matrix 431 rows 172 cols
[2024-06-02 19:19:41] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:19:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:19:41] [INFO ] Flow matrix only has 431 transitions (discarded 32 similar events)
[2024-06-02 19:19:41] [INFO ] Invariant cache hit.
[2024-06-02 19:19:42] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:19:42] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 19:19:42] [INFO ] Flow matrix only has 431 transitions (discarded 32 similar events)
[2024-06-02 19:19:42] [INFO ] Invariant cache hit.
[2024-06-02 19:19:42] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:19:45] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-06-02 19:19:46] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:19:47] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:19:47] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 430/602 variables, 172/186 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 61/247 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 1/603 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 9 (OVERLAPS) 0/603 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 248 constraints, problems are : Problem set: 0 solved, 462 unsolved in 27454 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 430/602 variables, 172/186 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 61/247 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 462/709 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 19:20:21] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:20:23] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:20:24] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 3/712 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 462 unsolved
SMT process timed out in 57817ms, After SMT, problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 57824ms
Starting structural reductions in LTL mode, iteration 1 : 172/176 places, 463/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58274 ms. Remains : 172/176 places, 463/471 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-13-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLCardinality-12 finished in 58482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 471/471 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 175 transition count 467
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 172 transition count 467
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 168 transition count 459
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 168 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 168 transition count 458
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 166 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 166 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 164 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 164 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 163 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 163 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 162 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 162 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 161 transition count 441
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 161 transition count 441
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 160 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 160 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 159 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 159 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 158 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 158 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 157 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 157 transition count 432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 156 transition count 430
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 153 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 150 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 150 transition count 427
Applied a total of 57 rules in 58 ms. Remains 150 /176 variables (removed 26) and now considering 427/471 (removed 44) transitions.
[2024-06-02 19:20:40] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 150 cols
[2024-06-02 19:20:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:20:40] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 19:20:40] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 19:20:40] [INFO ] Invariant cache hit.
[2024-06-02 19:20:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:20:40] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-06-02 19:20:40] [INFO ] Redundant transitions in 3 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 19:20:40] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 19:20:40] [INFO ] Invariant cache hit.
[2024-06-02 19:20:40] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 19:20:42] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:20:42] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:20:42] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:20:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:20:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:20:44] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:20:44] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:20:44] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 19:20:51] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:20:51] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 228 constraints, problems are : Problem set: 0 solved, 420 unsolved in 19722 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/648 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 19:21:07] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/537 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
After SMT, in 50083ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 50088ms
Starting structural reductions in SI_LTL mode, iteration 1 : 150/176 places, 427/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50620 ms. Remains : 150/176 places, 427/471 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLCardinality-13 finished in 50712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 471/471 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 175 transition count 467
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 172 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 170 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 170 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 170 transition count 462
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 167 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 164 transition count 465
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 164 transition count 459
Applied a total of 29 rules in 32 ms. Remains 164 /176 variables (removed 12) and now considering 459/471 (removed 12) transitions.
[2024-06-02 19:21:31] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
// Phase 1: matrix 420 rows 164 cols
[2024-06-02 19:21:31] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:21:31] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 19:21:31] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 19:21:31] [INFO ] Invariant cache hit.
[2024-06-02 19:21:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 19:21:31] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-02 19:21:31] [INFO ] Redundant transitions in 6 ms returned []
Running 452 sub problems to find dead transitions.
[2024-06-02 19:21:31] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 19:21:31] [INFO ] Invariant cache hit.
[2024-06-02 19:21:31] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:21:33] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:21:33] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:21:33] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:21:33] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:21:33] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:21:33] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:21:33] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:21:34] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:21:35] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:21:35] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:21:35] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 419/583 variables, 164/182 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 60/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:21:43] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:21:43] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (OVERLAPS) 0/583 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/584 variables, and 244 constraints, problems are : Problem set: 0 solved, 452 unsolved in 23104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 419/583 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 452/696 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:22:05] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 19:22:23] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 700 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 17/17 constraints]
After SMT, in 53535ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 53540ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 459/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53924 ms. Remains : 164/176 places, 459/471 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-13-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLCardinality-15 finished in 54055 ms.
All properties solved by simple procedures.
Total runtime 454827 ms.
ITS solved all properties within timeout

BK_STOP 1717356145130

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-13"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-13, 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 r553-tall-171734901300267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 ;