Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-14-LTLFireability-00
FORMULA_NAME FireWire-PT-14-LTLFireability-01
FORMULA_NAME FireWire-PT-14-LTLFireability-02
FORMULA_NAME FireWire-PT-14-LTLFireability-03
FORMULA_NAME FireWire-PT-14-LTLFireability-04
FORMULA_NAME FireWire-PT-14-LTLFireability-05
FORMULA_NAME FireWire-PT-14-LTLFireability-06
FORMULA_NAME FireWire-PT-14-LTLFireability-07
FORMULA_NAME FireWire-PT-14-LTLFireability-08
FORMULA_NAME FireWire-PT-14-LTLFireability-09
FORMULA_NAME FireWire-PT-14-LTLFireability-10
FORMULA_NAME FireWire-PT-14-LTLFireability-11
FORMULA_NAME FireWire-PT-14-LTLFireability-12
FORMULA_NAME FireWire-PT-14-LTLFireability-13
FORMULA_NAME FireWire-PT-14-LTLFireability-14
FORMULA_NAME FireWire-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717366752976

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 22:19:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:19:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:19:14] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 22:19:14] [INFO ] Transformed 205 places.
[2024-06-02 22:19:14] [INFO ] Transformed 610 transitions.
[2024-06-02 22:19:14] [INFO ] Found NUPN structural information;
[2024-06-02 22:19:14] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
FORMULA FireWire-PT-14-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 199 transition count 527
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 199 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 199 transition count 524
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 198 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 198 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 197 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 197 transition count 519
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 196 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 196 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 195 transition count 514
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 195 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 194 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 194 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 193 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 193 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 192 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 192 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 191 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 191 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 190 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 190 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 189 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 189 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 188 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 188 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 187 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 187 transition count 495
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 45 place count 187 transition count 489
Applied a total of 45 rules in 107 ms. Remains 187 /205 variables (removed 18) and now considering 489/539 (removed 50) transitions.
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
// Phase 1: matrix 457 rows 187 cols
[2024-06-02 22:19:14] [INFO ] Computed 10 invariants in 23 ms
[2024-06-02 22:19:14] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
[2024-06-02 22:19:14] [INFO ] Invariant cache hit.
[2024-06-02 22:19:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 22:19:15] [INFO ] Implicit Places using invariants and state equation in 384 ms returned [71, 133]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 679 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/205 places, 489/539 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 806 ms. Remains : 185/205 places, 489/539 transitions.
Support contains 36 out of 185 places after structural reductions.
[2024-06-02 22:19:15] [INFO ] Flatten gal took : 100 ms
[2024-06-02 22:19:15] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:19:15] [INFO ] Input system was already deterministic with 489 transitions.
RANDOM walk for 40000 steps (1177 resets) in 1765 ms. (22 steps per ms) remains 6/27 properties
BEST_FIRST walk for 40003 steps (16 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (257 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (243 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (289 resets) in 89 ms. (444 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (56 resets) in 145 ms. (273 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (236 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
[2024-06-02 22:19:16] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
// Phase 1: matrix 457 rows 185 cols
[2024-06-02 22:19:16] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:19:16] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 112/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 55/175 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 451/626 variables, 175/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 66/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 15/641 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/642 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/642 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 112/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 55/175 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 9 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:19:17] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 451/626 variables, 175/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 66/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 15/641 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/641 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/642 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/642 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/642 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 268 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1647ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1587 ms.
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 489/489 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 185 transition count 486
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 185 transition count 483
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 9 place count 182 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 181 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 180 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 180 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 179 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 178 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 177 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 177 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 176 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 176 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 175 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 175 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 174 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 174 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 173 transition count 460
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 173 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 172 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 172 transition count 458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 171 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 171 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 170 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 170 transition count 454
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 168 transition count 452
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 1 with 6 rules applied. Total rules applied 43 place count 165 transition count 458
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 165 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 165 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 165 transition count 455
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 2 with 9 rules applied. Total rules applied 64 place count 162 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 162 transition count 443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 161 transition count 442
Applied a total of 71 rules in 143 ms. Remains 161 /185 variables (removed 24) and now considering 442/489 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 161/185 places, 442/489 transitions.
RANDOM walk for 40000 steps (1325 resets) in 935 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (286 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (295 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 373 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (248 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 591349 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 4
Probabilistic random walk after 591349 steps, saw 175342 distinct states, run finished after 3004 ms. (steps per millisecond=196 ) properties seen :0
[2024-06-02 22:19:23] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 161 cols
[2024-06-02 22:19:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:19:23] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/565 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/566 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/565 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1684 ms.
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 19 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 161/161 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 22:19:26] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:19:26] [INFO ] Invariant cache hit.
[2024-06-02 22:19:26] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:19:26] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:19:26] [INFO ] Invariant cache hit.
[2024-06-02 22:19:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:19:26] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 330 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 442/442 transitions.
Applied a total of 0 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 349 ms. Remains : 160/161 places, 442/442 transitions.
RANDOM walk for 40000 steps (1227 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (277 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (261 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (49 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (248 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 642834 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 4
Probabilistic random walk after 642834 steps, saw 190426 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2024-06-02 22:19:29] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 22:19:29] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:19:29] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/564 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 228 constraints, problems are : Problem set: 0 solved, 4 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/564 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 232 constraints, problems are : Problem set: 0 solved, 4 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 944ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1304 ms.
Support contains 8 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 17 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 22:19:32] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:19:32] [INFO ] Invariant cache hit.
[2024-06-02 22:19:32] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 22:19:32] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:19:32] [INFO ] Invariant cache hit.
[2024-06-02 22:19:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:19:32] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-06-02 22:19:32] [INFO ] Redundant transitions in 19 ms returned []
Running 436 sub problems to find dead transitions.
[2024-06-02 22:19:32] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:19:32] [INFO ] Invariant cache hit.
[2024-06-02 22:19:32] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:19:34] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:19:34] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:19:34] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:19:34] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:19:34] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:19:35] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:19:35] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:19:35] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:19:35] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:19:41] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:19:44] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:19:44] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:19:47] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:19:48] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:19:54] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 245 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 436/681 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:20:09] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 18/18 constraints]
After SMT, in 60524ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60899 ms. Remains : 160/160 places, 442/442 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 135 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 4 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 297
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 134 transition count 288
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 133 transition count 287
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 133 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
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 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 48 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 22:20:33] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 22:20:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:20:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:20:33] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:20:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 22:20:33] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 22:20:33] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:20:33] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:20:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
TRAPS : Iteration 1
[2024-06-02 22:20:33] [INFO ] After 357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:20:33] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 576 ms.
Computed a total of 44 stabilizing places and 101 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((G(p1)||X(p2)||G(p3)||p0)))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 173 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 173 transition count 460
Applied a total of 24 rules in 14 ms. Remains 173 /185 variables (removed 12) and now considering 460/489 (removed 29) transitions.
[2024-06-02 22:20:34] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
// Phase 1: matrix 428 rows 173 cols
[2024-06-02 22:20:34] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:20:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 22:20:34] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2024-06-02 22:20:34] [INFO ] Invariant cache hit.
[2024-06-02 22:20:34] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 22:20:34] [INFO ] Implicit Places using invariants and state equation in 505 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 599 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/185 places, 460/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 172 /172 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 172/185 places, 460/489 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-00 finished in 984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 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 185 transition count 486
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 182 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 180 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 180 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 178 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 178 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 176 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 176 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 174 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 174 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 172 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 172 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 170 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 170 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 168 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 168 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 166 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 166 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 164 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 164 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 162 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 162 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 160 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 160 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 158 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 158 transition count 428
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 0 with 6 rules applied. Total rules applied 60 place count 155 transition count 425
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 0 with 6 rules applied. Total rules applied 66 place count 152 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 152 transition count 425
Applied a total of 72 rules in 85 ms. Remains 152 /185 variables (removed 33) and now considering 425/489 (removed 64) transitions.
[2024-06-02 22:20:35] [INFO ] Flow matrix only has 386 transitions (discarded 39 similar events)
// Phase 1: matrix 386 rows 152 cols
[2024-06-02 22:20:35] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:20:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:20:35] [INFO ] Flow matrix only has 386 transitions (discarded 39 similar events)
[2024-06-02 22:20:35] [INFO ] Invariant cache hit.
[2024-06-02 22:20:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:20:35] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 359 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/185 places, 425/489 transitions.
Applied a total of 0 rules in 10 ms. Remains 151 /151 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 455 ms. Remains : 151/185 places, 425/489 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-01 finished in 506 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) U X(p2))&&p0)))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 20 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 22:20:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 22:20:35] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:20:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:20:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:20:35] [INFO ] Invariant cache hit.
[2024-06-02 22:20:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:20:35] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-02 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!p0))) U (!p1&&X(!p2))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 173 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 173 transition count 460
Applied a total of 24 rules in 20 ms. Remains 173 /185 variables (removed 12) and now considering 460/489 (removed 29) transitions.
[2024-06-02 22:20:36] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
// Phase 1: matrix 428 rows 173 cols
[2024-06-02 22:20:36] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:20:36] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:20:36] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2024-06-02 22:20:36] [INFO ] Invariant cache hit.
[2024-06-02 22:20:36] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 22:20:36] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 365 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/185 places, 460/489 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 388 ms. Remains : 172/185 places, 460/489 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR p1 p2), p0, p2, p0, true]
Running random walk in product with property : FireWire-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 31 stabilizing places and 72 stable transitions
Computed a total of 31 stabilizing places and 72 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-03 finished in 1180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 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 184 transition count 485
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 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 176 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 176 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 175 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 175 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 168 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 168 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 167 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 167 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 40 place count 164 transition count 448
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 0 with 6 rules applied. Total rules applied 46 place count 161 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 161 transition count 448
Applied a total of 52 rules in 53 ms. Remains 161 /185 variables (removed 24) and now considering 448/489 (removed 41) transitions.
[2024-06-02 22:20:37] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
// Phase 1: matrix 409 rows 161 cols
[2024-06-02 22:20:37] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:20:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:20:37] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
[2024-06-02 22:20:37] [INFO ] Invariant cache hit.
[2024-06-02 22:20:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:20:37] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 355 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/185 places, 448/489 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 417 ms. Remains : 160/185 places, 448/489 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-04
Product exploration explored 100000 steps with 14 reset in 82 ms.
Product exploration explored 100000 steps with 4 reset in 81 ms.
Computed a total of 22 stabilizing places and 60 stable transitions
Computed a total of 22 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1302 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (388 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (387 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (384 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (284 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 548950 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :1 out of 4
Probabilistic random walk after 548950 steps, saw 143451 distinct states, run finished after 3003 ms. (steps per millisecond=182 ) properties seen :1
[2024-06-02 22:20:41] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
// Phase 1: matrix 409 rows 160 cols
[2024-06-02 22:20:41] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:20:41] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 357/459 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 98/557 variables, 50/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/567 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/568 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/569 variables, and 227 constraints, problems are : Problem set: 0 solved, 3 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 98/102 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 357/459 variables, 102/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 98/557 variables, 50/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 3/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 20/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 2/220 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/567 variables, 7/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/568 variables, 1/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 22:20:42] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/569 variables, and 230 constraints, problems are : Problem set: 1 solved, 2 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 697ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 448/448 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 160 transition count 442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 160 transition count 448
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 1 with 9 rules applied. Total rules applied 18 place count 157 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 157 transition count 436
Applied a total of 24 rules in 14 ms. Remains 157 /160 variables (removed 3) and now considering 436/448 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 157/160 places, 436/448 transitions.
RANDOM walk for 37767 steps (1198 resets) in 144 ms. (260 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 28 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-04 finished in 5091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (p0 U p1)))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 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 184 transition count 485
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 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 175 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 175 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 168 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 167 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 166 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 166 transition count 448
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 0 with 6 rules applied. Total rules applied 42 place count 163 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 46 place count 161 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 161 transition count 445
Applied a total of 50 rules in 41 ms. Remains 161 /185 variables (removed 24) and now considering 445/489 (removed 44) transitions.
[2024-06-02 22:20:42] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
// Phase 1: matrix 409 rows 161 cols
[2024-06-02 22:20:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:20:42] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 22:20:42] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2024-06-02 22:20:42] [INFO ] Invariant cache hit.
[2024-06-02 22:20:42] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 22:20:42] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 383 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/185 places, 445/489 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 431 ms. Remains : 160/185 places, 445/489 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), p0]
Running random walk in product with property : FireWire-PT-14-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-05 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||!(p1 U (X((p1 U p2))||p1))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 24 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 22:20:42] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 22:20:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:20:43] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-02 22:20:43] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:20:43] [INFO ] Invariant cache hit.
[2024-06-02 22:20:43] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:20:43] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 473 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p2), p2]
Running random walk in product with property : FireWire-PT-14-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 110 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-07 finished in 1062 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||X(X(p1)))))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 172 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 172 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 171 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 171 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 170 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 170 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 169 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 168 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 168 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 167 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 167 transition count 445
Applied a total of 36 rules in 16 ms. Remains 167 /185 variables (removed 18) and now considering 445/489 (removed 44) transitions.
[2024-06-02 22:20:43] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
// Phase 1: matrix 413 rows 167 cols
[2024-06-02 22:20:43] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:20:44] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 22:20:44] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
[2024-06-02 22:20:44] [INFO ] Invariant cache hit.
[2024-06-02 22:20:44] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:20:44] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/185 places, 445/489 transitions.
Applied a total of 0 rules in 1 ms. Remains 166 /166 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 341 ms. Remains : 166/185 places, 445/489 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 209 ms.
Product exploration explored 100000 steps with 33333 reset in 144 ms.
Computed a total of 25 stabilizing places and 57 stable transitions
Computed a total of 25 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-10 finished in 891 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(F(p1))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Applied a total of 22 rules in 13 ms. Remains 174 /185 variables (removed 11) and now considering 462/489 (removed 27) transitions.
[2024-06-02 22:20:44] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
// Phase 1: matrix 430 rows 174 cols
[2024-06-02 22:20:44] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:20:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 22:20:44] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 22:20:44] [INFO ] Invariant cache hit.
[2024-06-02 22:20:45] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 22:20:45] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 22:20:45] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 22:20:45] [INFO ] Invariant cache hit.
[2024-06-02 22:20:45] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:20:50] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:20:50] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:20:50] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/603 variables, 174/192 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 62/254 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 1/604 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 9 (OVERLAPS) 0/604 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 255 constraints, problems are : Problem set: 0 solved, 461 unsolved in 26411 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/603 variables, 174/192 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 62/254 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 461/715 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 22:21:20] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 2 ms to minimize.
[2024-06-02 22:21:20] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:21:30] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 3/718 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/604 variables, and 718 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 13/13 constraints]
After SMT, in 56815ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 56821ms
Starting structural reductions in LTL mode, iteration 1 : 174/185 places, 462/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57244 ms. Remains : 174/185 places, 462/489 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 33 stabilizing places and 74 stable transitions
Computed a total of 33 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-12 finished in 57664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||F(p2))))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 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 184 transition count 485
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 181 transition count 485
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 180 transition count 482
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 180 transition count 482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 179 transition count 480
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 179 transition count 480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 178 transition count 477
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 178 transition count 477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 177 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 176 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 176 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 175 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 175 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 167 transition count 454
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 0 with 6 rules applied. Total rules applied 40 place count 164 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 164 transition count 454
Applied a total of 46 rules in 44 ms. Remains 164 /185 variables (removed 21) and now considering 454/489 (removed 35) transitions.
[2024-06-02 22:21:42] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 164 cols
[2024-06-02 22:21:42] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:21:42] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:21:42] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 22:21:42] [INFO ] Invariant cache hit.
[2024-06-02 22:21:42] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:21:42] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 375 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/185 places, 454/489 transitions.
Applied a total of 0 rules in 12 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 432 ms. Remains : 163/185 places, 454/489 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-13
Product exploration explored 100000 steps with 6 reset in 57 ms.
Product exploration explored 100000 steps with 4 reset in 67 ms.
Computed a total of 25 stabilizing places and 66 stable transitions
Computed a total of 25 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 110 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1296 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (267 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (291 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (273 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (258 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (280 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (266 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (260 resets) in 180 ms. (221 steps per ms) remains 6/8 properties
[2024-06-02 22:21:43] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 22:21:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:21:43] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 9/576 variables, 6/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/577 variables, 1/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/577 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 231 constraints, problems are : Problem set: 1 solved, 5 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 5/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 22:21:44] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:21:44] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 9/576 variables, 6/236 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 1/237 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 22:21:45] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:21:45] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 2/239 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/576 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/577 variables, 1/240 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/577 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/577 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/578 variables, and 240 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 1712ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 651 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 454/454 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 454
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 1 with 9 rules applied. Total rules applied 18 place count 160 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 160 transition count 442
Applied a total of 24 rules in 14 ms. Remains 160 /163 variables (removed 3) and now considering 442/454 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 160/163 places, 442/454 transitions.
RANDOM walk for 40000 steps (1324 resets) in 413 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (276 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (258 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (261 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (255 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (265 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 470656 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 5
Probabilistic random walk after 470656 steps, saw 139488 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2024-06-02 22:21:49] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 22:21:49] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:21:49] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 9/564 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 228 constraints, problems are : Problem set: 0 solved, 5 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:21:50] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 9/564 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/565 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/565 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 234 constraints, problems are : Problem set: 0 solved, 5 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1262ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 607 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 22:21:51] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:21:51] [INFO ] Invariant cache hit.
[2024-06-02 22:21:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:21:51] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:21:51] [INFO ] Invariant cache hit.
[2024-06-02 22:21:51] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:21:51] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-02 22:21:51] [INFO ] Redundant transitions in 7 ms returned []
Running 436 sub problems to find dead transitions.
[2024-06-02 22:21:51] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:21:51] [INFO ] Invariant cache hit.
[2024-06-02 22:21:51] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:21:53] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:21:53] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:21:53] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:21:53] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:21:54] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:21:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:21:54] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:21:54] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:21:54] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 2 ms to minimize.
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 103 places in 83 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:22:01] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:22:03] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:22:03] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:22:07] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 5 ms to minimize.
[2024-06-02 22:22:08] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:22:13] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 245 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 436/681 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:22:28] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 18/18 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60710 ms. Remains : 160/160 places, 442/442 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 1 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 297
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 134 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 287
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 133 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
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 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 21 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 5 properties.
[2024-06-02 22:22:52] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 22:22:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:22:52] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 22:22:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:22:52] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 22:22:52] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-06-02 22:22:52] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-02 22:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2024-06-02 22:22:52] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 22:22:52] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 566 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 196 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 454/454 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-06-02 22:22:53] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 22:22:53] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:22:53] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:22:53] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 22:22:53] [INFO ] Invariant cache hit.
[2024-06-02 22:22:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:22:53] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 22:22:53] [INFO ] Redundant transitions in 3 ms returned []
Running 447 sub problems to find dead transitions.
[2024-06-02 22:22:53] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 22:22:53] [INFO ] Invariant cache hit.
[2024-06-02 22:22:53] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:22:55] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:22:55] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:22:55] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:22:55] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:22:55] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:22:56] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:22:56] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:22:56] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:23:05] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:23:05] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:23:08] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 8 (OVERLAPS) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 245 constraints, problems are : Problem set: 0 solved, 447 unsolved in 25444 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 447/692 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:23:25] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:23:25] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 694 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 16/16 constraints]
After SMT, in 55824ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 55830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56147 ms. Remains : 163/163 places, 454/454 transitions.
Computed a total of 25 stabilizing places and 66 stable transitions
Computed a total of 25 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1316 resets) in 383 ms. (104 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (281 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (266 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (275 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (275 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (267 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
[2024-06-02 22:23:49] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 22:23:49] [INFO ] Invariant cache hit.
[2024-06-02 22:23:49] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 9/576 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/577 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/577 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 231 constraints, problems are : Problem set: 0 solved, 5 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/576 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/576 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/577 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/577 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/577 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/578 variables, and 238 constraints, problems are : Problem set: 0 solved, 5 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 1167ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 511 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 454/454 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 454
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 1 with 9 rules applied. Total rules applied 18 place count 160 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 160 transition count 442
Applied a total of 24 rules in 22 ms. Remains 160 /163 variables (removed 3) and now considering 442/454 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 160/163 places, 442/454 transitions.
RANDOM walk for 40000 steps (1309 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (277 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (242 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (268 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (274 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 413443 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 4
Probabilistic random walk after 413443 steps, saw 123517 distinct states, run finished after 3003 ms. (steps per millisecond=137 ) properties seen :0
[2024-06-02 22:23:54] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 22:23:54] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:23:54] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/564 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 228 constraints, problems are : Problem set: 0 solved, 4 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/564 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/565 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/565 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/565 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 235 constraints, problems are : Problem set: 0 solved, 4 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1207ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 559 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 22:23:56] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:23:56] [INFO ] Invariant cache hit.
[2024-06-02 22:23:56] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:23:56] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:23:56] [INFO ] Invariant cache hit.
[2024-06-02 22:23:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:23:56] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 22:23:56] [INFO ] Redundant transitions in 3 ms returned []
Running 436 sub problems to find dead transitions.
[2024-06-02 22:23:56] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 22:23:56] [INFO ] Invariant cache hit.
[2024-06-02 22:23:56] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:23:58] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:23:58] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:23:58] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:23:59] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2024-06-02 22:23:59] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:23:59] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:23:59] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:23:59] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:23:59] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-06-02 22:24:00] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:24:00] [INFO ] Deduced a trap composed of 103 places in 76 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:24:06] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:24:08] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:24:08] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:24:12] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:24:13] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:24:18] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 245 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 436/681 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 22:24:34] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 18/18 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60727 ms. Remains : 160/160 places, 442/442 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 1 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 297
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 134 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 287
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 133 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
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 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 31 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 22:24:57] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 22:24:57] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:24:57] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:24:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:24:57] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 22:24:57] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:24:57] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 319 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 176 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 4 reset in 57 ms.
Product exploration explored 100000 steps with 1 reset in 59 ms.
Built C files in :
/tmp/ltsmin14442266980587081979
[2024-06-02 22:24:58] [INFO ] Computing symmetric may disable matrix : 454 transitions.
[2024-06-02 22:24:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:24:58] [INFO ] Computing symmetric may enable matrix : 454 transitions.
[2024-06-02 22:24:58] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:24:58] [INFO ] Computing Do-Not-Accords matrix : 454 transitions.
[2024-06-02 22:24:58] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:24:58] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14442266980587081979
Running compilation step : cd /tmp/ltsmin14442266980587081979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1187 ms.
Running link step : cd /tmp/ltsmin14442266980587081979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14442266980587081979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13006434893674042326.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 454/454 transitions.
Applied a total of 0 rules in 13 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-06-02 22:25:13] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 22:25:13] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:25:13] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 22:25:13] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 22:25:13] [INFO ] Invariant cache hit.
[2024-06-02 22:25:13] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:25:13] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 22:25:13] [INFO ] Redundant transitions in 4 ms returned []
Running 447 sub problems to find dead transitions.
[2024-06-02 22:25:13] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 22:25:13] [INFO ] Invariant cache hit.
[2024-06-02 22:25:13] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:25:16] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:25:16] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:25:16] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:25:22] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:25:22] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:25:22] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:25:25] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:25:25] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:25:28] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 8 (OVERLAPS) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 245 constraints, problems are : Problem set: 0 solved, 447 unsolved in 25712 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 447/692 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 22:25:45] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:25:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 694 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 16/16 constraints]
After SMT, in 56090ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 56097ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56439 ms. Remains : 163/163 places, 454/454 transitions.
Built C files in :
/tmp/ltsmin12830145189394113566
[2024-06-02 22:26:09] [INFO ] Computing symmetric may disable matrix : 454 transitions.
[2024-06-02 22:26:09] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:26:09] [INFO ] Computing symmetric may enable matrix : 454 transitions.
[2024-06-02 22:26:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:26:09] [INFO ] Computing Do-Not-Accords matrix : 454 transitions.
[2024-06-02 22:26:09] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:26:09] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12830145189394113566
Running compilation step : cd /tmp/ltsmin12830145189394113566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1083 ms.
Running link step : cd /tmp/ltsmin12830145189394113566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12830145189394113566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8508921459141278594.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:26:25] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:26:25] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:26:25] [INFO ] Time to serialize gal into /tmp/LTL7373124813078673044.gal : 5 ms
[2024-06-02 22:26:25] [INFO ] Time to serialize properties into /tmp/LTL16678997799604758488.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7373124813078673044.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16821204815127400183.hoa' '-atoms' '/tmp/LTL16678997799604758488.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((p3==0)||(p127==0))"))||(G(("((p4==1)&&(p109==1))")||(F("((p146==0)||(p166==0))")))))))
Formula 0 simplified : G(F!"((p3==0)||(p127==0))" & F(!"((p4==1)&&(p109==1))" & G!"((p146==0)||(p166==0))"))
Detected timeout of ITS tools.
[2024-06-02 22:26:55] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:26:55] [INFO ] Applying decomposition
[2024-06-02 22:26:55] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10719592952601899548.txt' '-o' '/tmp/graph10719592952601899548.bin' '-w' '/tmp/graph10719592952601899548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10719592952601899548.bin' '-l' '-1' '-v' '-w' '/tmp/graph10719592952601899548.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:26:55] [INFO ] Decomposing Gal with order
[2024-06-02 22:26:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:26:55] [INFO ] Removed a total of 697 redundant transitions.
[2024-06-02 22:26:55] [INFO ] Flatten gal took : 71 ms
[2024-06-02 22:26:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 17 ms.
[2024-06-02 22:26:55] [INFO ] Time to serialize gal into /tmp/LTL6631868088705433929.gal : 5 ms
[2024-06-02 22:26:55] [INFO ] Time to serialize properties into /tmp/LTL13631089624407262802.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6631868088705433929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13631089624407262802.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u0.p3==0)||(i0.u22.p127==0))"))||(G(("((i6.i0.u1.p4==1)&&(i4.u31.p109==1))")||(F("((i7.u41.p146==0)||(i6.i0.u48.p166==0)...164
Formula 0 simplified : G(F!"((i0.u0.p3==0)||(i0.u22.p127==0))" & F(!"((i6.i0.u1.p4==1)&&(i4.u31.p109==1))" & G!"((i7.u41.p146==0)||(i6.i0.u48.p166==0))"))
Detected timeout of ITS tools.
Treatment of property FireWire-PT-14-LTLFireability-13 finished in 328074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 12 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 22:27:10] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 22:27:10] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:27:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:27:10] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:27:10] [INFO ] Invariant cache hit.
[2024-06-02 22:27:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:27:10] [INFO ] Implicit Places using invariants and state equation in 254 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 349 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-14
Product exploration explored 100000 steps with 1 reset in 47 ms.
Product exploration explored 100000 steps with 3 reset in 47 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
RANDOM walk for 892 steps (28 resets) in 5 ms. (148 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-14 finished in 798 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 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 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 184 transition count 485
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 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 175 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 175 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 173 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 171 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 171 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 169 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 169 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 167 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 167 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 165 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 165 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 163 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 163 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 161 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 161 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 159 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 159 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 157 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 157 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 60 place count 154 transition count 424
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 0 with 6 rules applied. Total rules applied 66 place count 151 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 151 transition count 424
Applied a total of 72 rules in 40 ms. Remains 151 /185 variables (removed 34) and now considering 424/489 (removed 65) transitions.
[2024-06-02 22:27:11] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 151 cols
[2024-06-02 22:27:11] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:27:11] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:27:11] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:27:11] [INFO ] Invariant cache hit.
[2024-06-02 22:27:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:27:11] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 332 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/185 places, 424/489 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 150/185 places, 424/489 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 45 ms.
Product exploration explored 100000 steps with 15 reset in 45 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7444 steps (255 resets) in 30 ms. (240 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 424/424 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 22:27:12] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 150 cols
[2024-06-02 22:27:12] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:27:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:27:12] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:27:12] [INFO ] Invariant cache hit.
[2024-06-02 22:27:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:27:12] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-06-02 22:27:12] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:27:12] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:27:12] [INFO ] Invariant cache hit.
[2024-06-02 22:27:12] [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, 417 unsolved
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 4 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:27:14] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:27:15] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:27:15] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:27:16] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:27:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:27:17] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:27:18] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 384/534 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:27:27] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:27:27] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/535 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 23570 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/534 variables, 150/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/535 variables, and 644 constraints, problems are : Problem set: 0 solved, 417 unsolved in 24358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
After SMT, in 48222ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 48226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48522 ms. Remains : 150/150 places, 424/424 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8796 steps (291 resets) in 29 ms. (293 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7 reset in 45 ms.
Product exploration explored 100000 steps with 12 reset in 45 ms.
Built C files in :
/tmp/ltsmin15116025079628845980
[2024-06-02 22:28:01] [INFO ] Computing symmetric may disable matrix : 424 transitions.
[2024-06-02 22:28:01] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:28:01] [INFO ] Computing symmetric may enable matrix : 424 transitions.
[2024-06-02 22:28:01] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:28:01] [INFO ] Computing Do-Not-Accords matrix : 424 transitions.
[2024-06-02 22:28:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:28:01] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15116025079628845980
Running compilation step : cd /tmp/ltsmin15116025079628845980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1162 ms.
Running link step : cd /tmp/ltsmin15116025079628845980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15116025079628845980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9328753877468806085.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 424/424 transitions.
Applied a total of 0 rules in 13 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 22:28:16] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:28:16] [INFO ] Invariant cache hit.
[2024-06-02 22:28:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:28:16] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:28:16] [INFO ] Invariant cache hit.
[2024-06-02 22:28:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:28:16] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 22:28:16] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:28:16] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:28:16] [INFO ] Invariant cache hit.
[2024-06-02 22:28:16] [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, 417 unsolved
[2024-06-02 22:28:18] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:28:18] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:28:18] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:28:18] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:28:18] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:28:19] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:28:19] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:28:20] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:28:21] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:28:21] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:28:22] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:28:22] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 384/534 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:28:31] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/535 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 23448 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/534 variables, 150/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/535 variables, and 644 constraints, problems are : Problem set: 0 solved, 417 unsolved in 24089 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
After SMT, in 47838ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 47843ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48174 ms. Remains : 150/150 places, 424/424 transitions.
Built C files in :
/tmp/ltsmin82251144321758226
[2024-06-02 22:29:04] [INFO ] Computing symmetric may disable matrix : 424 transitions.
[2024-06-02 22:29:04] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:04] [INFO ] Computing symmetric may enable matrix : 424 transitions.
[2024-06-02 22:29:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:04] [INFO ] Computing Do-Not-Accords matrix : 424 transitions.
[2024-06-02 22:29:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:04] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin82251144321758226
Running compilation step : cd /tmp/ltsmin82251144321758226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 992 ms.
Running link step : cd /tmp/ltsmin82251144321758226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin82251144321758226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13751703257340813025.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:29:19] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:29:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:29:19] [INFO ] Time to serialize gal into /tmp/LTL3127353967745910584.gal : 3 ms
[2024-06-02 22:29:19] [INFO ] Time to serialize properties into /tmp/LTL14040360517711773841.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3127353967745910584.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2590737326938609902.hoa' '-atoms' '/tmp/LTL14040360517711773841.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14040360517711773841.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2590737326938609902.hoa
Detected timeout of ITS tools.
[2024-06-02 22:29:35] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:29:35] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:29:35] [INFO ] Time to serialize gal into /tmp/LTL1435541822934271216.gal : 3 ms
[2024-06-02 22:29:35] [INFO ] Time to serialize properties into /tmp/LTL16587741239309311768.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1435541822934271216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16587741239309311768.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p10!=1)||(p184!=1))"))))
Formula 0 simplified : FG!"((p10!=1)||(p184!=1))"
Detected timeout of ITS tools.
[2024-06-02 22:29:50] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:29:50] [INFO ] Applying decomposition
[2024-06-02 22:29:50] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9651706070274881086.txt' '-o' '/tmp/graph9651706070274881086.bin' '-w' '/tmp/graph9651706070274881086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9651706070274881086.bin' '-l' '-1' '-v' '-w' '/tmp/graph9651706070274881086.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:29:50] [INFO ] Decomposing Gal with order
[2024-06-02 22:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:29:50] [INFO ] Removed a total of 641 redundant transitions.
[2024-06-02 22:29:50] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 8 ms.
[2024-06-02 22:29:50] [INFO ] Time to serialize gal into /tmp/LTL4742207481357534290.gal : 3 ms
[2024-06-02 22:29:50] [INFO ] Time to serialize properties into /tmp/LTL16971182457781920897.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4742207481357534290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16971182457781920897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i0.u3.p10!=1)||(i7.u49.p184!=1))"))))
Formula 0 simplified : FG!"((i1.i0.u3.p10!=1)||(i7.u49.p184!=1))"
Detected timeout of ITS tools.
Treatment of property FireWire-PT-14-LTLFireability-15 finished in 173906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||F(p2))))))'
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)))'
[2024-06-02 22:30:05] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2024-06-02 22:30:05] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin13281613836564089791
[2024-06-02 22:30:05] [INFO ] Computing symmetric may disable matrix : 489 transitions.
[2024-06-02 22:30:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:30:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:30:05] [INFO ] Computing symmetric may enable matrix : 489 transitions.
[2024-06-02 22:30:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:30:05] [INFO ] Computing Do-Not-Accords matrix : 489 transitions.
[2024-06-02 22:30:05] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:30:05] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13281613836564089791
Running compilation step : cd /tmp/ltsmin13281613836564089791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16712999074521074795.txt' '-o' '/tmp/graph16712999074521074795.bin' '-w' '/tmp/graph16712999074521074795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16712999074521074795.bin' '-l' '-1' '-v' '-w' '/tmp/graph16712999074521074795.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:30:05] [INFO ] Decomposing Gal with order
[2024-06-02 22:30:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:30:05] [INFO ] Removed a total of 813 redundant transitions.
[2024-06-02 22:30:05] [INFO ] Flatten gal took : 62 ms
[2024-06-02 22:30:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 29 ms.
[2024-06-02 22:30:05] [INFO ] Time to serialize gal into /tmp/LTLFireability14671979862213752443.gal : 19 ms
[2024-06-02 22:30:05] [INFO ] Time to serialize properties into /tmp/LTLFireability3170136947289654893.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14671979862213752443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3170136947289654893.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("((i4.u0.p3==0)||(i4.u28.p127==0))"))||(G(("((i0.i0.u1.p4==1)&&(i3.u27.p109==1))")||(F("((i6.u48.p146==0)||(i7.i1.u54.p166==0)...164
Formula 0 simplified : G(F!"((i4.u0.p3==0)||(i4.u28.p127==0))" & F(!"((i0.i0.u1.p4==1)&&(i3.u27.p109==1))" & G!"((i6.u48.p146==0)||(i7.i1.u54.p166==0))"))
Compilation finished in 1249 ms.
Running link step : cd /tmp/ltsmin13281613836564089791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13281613836564089791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t20, t46, t49, t50, t52, t60, t65, t70, t75, t80, t88, t95, t98, t100, t137, t138, t139, t141...1377
Computing Next relation with stutter on 3.25939e+06 deadlock states
LTSmin run took 662741 ms.
FORMULA FireWire-PT-14-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13281613836564089791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
34560 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,345.647,3546724,1,0,5.07465e+06,6300,5207,2.11143e+07,418,50329,11467754
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !((G(F("((i7.i0.u3.p10!=1)||(i8.u60.p184!=1))"))))
Formula 1 simplified : FG!"((i7.i0.u3.p10!=1)||(i8.u60.p184!=1))"
Computing Next relation with stutter on 3.25939e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,345.729,3549912,1,0,5.08135e+06,6304,5254,2.11256e+07,420,50379,11485855
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA FireWire-PT-14-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1494826 ms.

BK_STOP 1717368248987

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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