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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 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 AutoFlight-PT-24a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717193524783

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:12:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:12:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:12:07] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-05-31 22:12:07] [INFO ] Transformed 607 places.
[2024-05-31 22:12:07] [INFO ] Transformed 605 transitions.
[2024-05-31 22:12:07] [INFO ] Found NUPN structural information;
[2024-05-31 22:12:07] [INFO ] Parsed PT model containing 607 places and 605 transitions and 1940 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 120 transitions
Reduce redundant transitions removed 120 transitions.
FORMULA AutoFlight-PT-24a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 607/607 places, 485/485 transitions.
Applied a total of 0 rules in 115 ms. Remains 607 /607 variables (removed 0) and now considering 485/485 (removed 0) transitions.
// Phase 1: matrix 485 rows 607 cols
[2024-05-31 22:12:08] [INFO ] Computed 148 invariants in 48 ms
[2024-05-31 22:12:10] [INFO ] Implicit Places using invariants in 1723 ms returned [7, 14, 28, 35, 49, 56, 63, 70, 77, 84, 91, 98, 112, 119, 133, 140, 147, 154, 161, 168, 171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 216, 219, 222, 225, 228, 231, 234, 240, 362, 460, 466, 472, 484, 490, 496, 502, 508, 514, 520, 526, 532, 538, 544, 550, 556, 562, 568, 574, 580, 586, 592, 598, 604]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 1781 ms to find 67 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/607 places, 485/485 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 517 transition count 462
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 517 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 516 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 516 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 515 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 515 transition count 460
Applied a total of 50 rules in 201 ms. Remains 515 /540 variables (removed 25) and now considering 460/485 (removed 25) transitions.
// Phase 1: matrix 460 rows 515 cols
[2024-05-31 22:12:10] [INFO ] Computed 81 invariants in 12 ms
[2024-05-31 22:12:10] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-31 22:12:10] [INFO ] Invariant cache hit.
[2024-05-31 22:12:11] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 22:12:11] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 515/607 places, 460/485 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3689 ms. Remains : 515/607 places, 460/485 transitions.
Support contains 42 out of 515 places after structural reductions.
[2024-05-31 22:12:12] [INFO ] Flatten gal took : 155 ms
[2024-05-31 22:12:12] [INFO ] Flatten gal took : 78 ms
[2024-05-31 22:12:12] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 36 out of 515 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (447 resets) in 3040 ms. (13 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40004 steps (12 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 332 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
[2024-05-31 22:12:14] [INFO ] Invariant cache hit.
[2024-05-31 22:12:14] [INFO ] State equation strengthened by 18 read => feed constraints.
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) 319/325 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 190/515 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 460/975 variables, 515/596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/975 variables, 18/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/975 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 975/975 variables, and 614 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 515/515 constraints, ReadFeed: 18/18 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) 319/325 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 190/515 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 460/975 variables, 515/596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/975 variables, 18/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/975 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 975/975 variables, and 619 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 515/515 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2114ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2088 steps, including 24 resets, run visited all 5 properties in 45 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 64 ms.
Computed a total of 7 stabilizing places and 1 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((F(p0)&&(p1||X(p2)))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 514 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 514 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 513 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Applied a total of 96 rules in 1144 ms. Remains 467 /515 variables (removed 48) and now considering 412/460 (removed 48) transitions.
// Phase 1: matrix 412 rows 467 cols
[2024-05-31 22:12:17] [INFO ] Computed 81 invariants in 5 ms
[2024-05-31 22:12:18] [INFO ] Implicit Places using invariants in 297 ms returned [19, 38, 93, 112, 179, 196, 379]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 298 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 460/515 places, 412/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 458 transition count 410
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 458 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 457 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 445 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 444 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 444 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 443 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 443 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 442 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 442 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 441 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 441 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 440 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 440 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 439 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 439 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 438 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 438 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 437 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 437 transition count 389
Applied a total of 46 rules in 200 ms. Remains 437 /460 variables (removed 23) and now considering 389/412 (removed 23) transitions.
// Phase 1: matrix 389 rows 437 cols
[2024-05-31 22:12:18] [INFO ] Computed 74 invariants in 6 ms
[2024-05-31 22:12:18] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-31 22:12:18] [INFO ] Invariant cache hit.
[2024-05-31 22:12:19] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/515 places, 389/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2379 ms. Remains : 437/515 places, 389/460 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-00
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-00 finished in 2920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 508 transition count 299
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 327 place count 348 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 328 place count 347 transition count 298
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 328 place count 347 transition count 251
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 445 place count 277 transition count 251
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 445 place count 277 transition count 228
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 491 place count 254 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 492 place count 253 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 253 transition count 227
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 593 place count 203 transition count 177
Applied a total of 593 rules in 117 ms. Remains 203 /515 variables (removed 312) and now considering 177/460 (removed 283) transitions.
// Phase 1: matrix 177 rows 203 cols
[2024-05-31 22:12:19] [INFO ] Computed 52 invariants in 2 ms
[2024-05-31 22:12:19] [INFO ] Implicit Places using invariants in 265 ms returned [156, 202]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 266 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/515 places, 177/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 200 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 175
Applied a total of 4 rules in 28 ms. Remains 199 /201 variables (removed 2) and now considering 175/177 (removed 2) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-31 22:12:19] [INFO ] Computed 50 invariants in 1 ms
[2024-05-31 22:12:20] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-31 22:12:20] [INFO ] Invariant cache hit.
[2024-05-31 22:12:20] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1053 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-02
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-02 finished in 1248 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' '!((p0 U X(p1)))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 561 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-31 22:12:21] [INFO ] Computed 81 invariants in 5 ms
[2024-05-31 22:12:21] [INFO ] Implicit Places using invariants in 317 ms returned [19, 38, 93, 112, 179, 196, 465]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 319 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/515 places, 411/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 458 transition count 410
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 457 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 445 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 444 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 444 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 443 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 443 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 442 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 442 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 441 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 441 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 440 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 440 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 439 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 439 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 438 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 438 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 437 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 437 transition count 389
Applied a total of 44 rules in 136 ms. Remains 437 /459 variables (removed 22) and now considering 389/411 (removed 22) transitions.
// Phase 1: matrix 389 rows 437 cols
[2024-05-31 22:12:21] [INFO ] Computed 74 invariants in 3 ms
[2024-05-31 22:12:22] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-31 22:12:22] [INFO ] Invariant cache hit.
[2024-05-31 22:12:22] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/515 places, 389/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1903 ms. Remains : 437/515 places, 389/460 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-03 finished in 2090 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 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 468 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-31 22:12:23] [INFO ] Computed 81 invariants in 8 ms
[2024-05-31 22:12:23] [INFO ] Implicit Places using invariants in 450 ms returned [19, 38, 93, 112, 179, 196, 379, 465]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 456 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 456 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 435 transition count 388
Applied a total of 46 rules in 159 ms. Remains 435 /458 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 435 cols
[2024-05-31 22:12:24] [INFO ] Computed 73 invariants in 5 ms
[2024-05-31 22:12:24] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 22:12:24] [INFO ] Invariant cache hit.
[2024-05-31 22:12:24] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1933 ms. Remains : 435/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3206 steps with 38 reset in 30 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-04 finished in 2062 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 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 515 transition count 328
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 383 transition count 328
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 264 place count 383 transition count 266
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 388 place count 321 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 390 place count 319 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 498 place count 266 transition count 211
Applied a total of 498 rules in 100 ms. Remains 266 /515 variables (removed 249) and now considering 211/460 (removed 249) transitions.
// Phase 1: matrix 211 rows 266 cols
[2024-05-31 22:12:25] [INFO ] Computed 81 invariants in 2 ms
[2024-05-31 22:12:25] [INFO ] Implicit Places using invariants in 536 ms returned [13, 63, 76, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 198, 265]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 538 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/515 places, 211/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 235 transition count 181
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 205 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 60 place count 205 transition count 178
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 202 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 201 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 201 transition count 177
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 2 with 4 rules applied. Total rules applied 72 place count 199 transition count 175
Applied a total of 72 rules in 16 ms. Remains 199 /235 variables (removed 36) and now considering 175/211 (removed 36) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-31 22:12:25] [INFO ] Computed 50 invariants in 1 ms
[2024-05-31 22:12:25] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 22:12:25] [INFO ] Invariant cache hit.
[2024-05-31 22:12:25] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 22:12:26] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1353 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-05
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-05 finished in 1467 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 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 508 transition count 296
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 332 place count 345 transition count 296
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 332 place count 345 transition count 249
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 449 place count 275 transition count 249
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 449 place count 275 transition count 226
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 495 place count 252 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 497 place count 250 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 499 place count 250 transition count 224
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 597 place count 201 transition count 175
Applied a total of 597 rules in 38 ms. Remains 201 /515 variables (removed 314) and now considering 175/460 (removed 285) transitions.
// Phase 1: matrix 175 rows 201 cols
[2024-05-31 22:12:26] [INFO ] Computed 52 invariants in 1 ms
[2024-05-31 22:12:26] [INFO ] Implicit Places using invariants in 294 ms returned [154, 200]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 296 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/515 places, 175/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 198 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 198 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 173
Applied a total of 4 rules in 50 ms. Remains 197 /199 variables (removed 2) and now considering 173/175 (removed 2) transitions.
// Phase 1: matrix 173 rows 197 cols
[2024-05-31 22:12:26] [INFO ] Computed 50 invariants in 1 ms
[2024-05-31 22:12:27] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-31 22:12:27] [INFO ] Invariant cache hit.
[2024-05-31 22:12:27] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 197/515 places, 173/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1117 ms. Remains : 197/515 places, 173/460 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-06
Product exploration explored 100000 steps with 1763 reset in 448 ms.
Product exploration explored 100000 steps with 1746 reset in 765 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 2708 steps (45 resets) in 32 ms. (82 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 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-31 22:12:29] [INFO ] Invariant cache hit.
[2024-05-31 22:12:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-31 22:12:29] [INFO ] Invariant cache hit.
[2024-05-31 22:12:29] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2024-05-31 22:12:29] [INFO ] Redundant transitions in 9 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-31 22:12:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 247 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5983 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 98/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 345 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6293 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 12327ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12332ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12949 ms. Remains : 197/197 places, 173/173 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 4187 steps (72 resets) in 33 ms. (123 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 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1763 reset in 512 ms.
Product exploration explored 100000 steps with 1777 reset in 363 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-31 22:12:43] [INFO ] Invariant cache hit.
[2024-05-31 22:12:43] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-31 22:12:43] [INFO ] Invariant cache hit.
[2024-05-31 22:12:44] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-31 22:12:44] [INFO ] Redundant transitions in 10 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-31 22:12:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 247 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5999 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 98/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 345 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6932 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 12968ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13669 ms. Remains : 197/197 places, 173/173 transitions.
Treatment of property AutoFlight-PT-24a-LTLFireability-06 finished in 30809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 604 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-31 22:12:57] [INFO ] Computed 81 invariants in 2 ms
[2024-05-31 22:12:58] [INFO ] Implicit Places using invariants in 315 ms returned [19, 38, 93, 112, 179, 196, 379, 465]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 318 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 456 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 435 transition count 388
Applied a total of 46 rules in 145 ms. Remains 435 /458 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 435 cols
[2024-05-31 22:12:58] [INFO ] Computed 73 invariants in 5 ms
[2024-05-31 22:12:58] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-31 22:12:58] [INFO ] Invariant cache hit.
[2024-05-31 22:12:59] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2202 ms. Remains : 435/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-07
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-07 finished in 2383 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 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 515 transition count 327
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 382 transition count 327
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 266 place count 382 transition count 267
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 386 place count 322 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 320 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 320 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 391 place count 319 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 313 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 313 transition count 258
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 500 place count 265 transition count 210
Applied a total of 500 rules in 78 ms. Remains 265 /515 variables (removed 250) and now considering 210/460 (removed 250) transitions.
// Phase 1: matrix 210 rows 265 cols
[2024-05-31 22:12:59] [INFO ] Computed 81 invariants in 2 ms
[2024-05-31 22:13:00] [INFO ] Implicit Places using invariants in 539 ms returned [13, 26, 63, 76, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 123, 124, 125, 126, 127, 128, 196, 264]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 551 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/515 places, 210/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 234 transition count 178
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 202 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 201 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 201 transition count 177
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 2 with 4 rules applied. Total rules applied 70 place count 199 transition count 175
Applied a total of 70 rules in 18 ms. Remains 199 /234 variables (removed 35) and now considering 175/210 (removed 35) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-31 22:13:00] [INFO ] Computed 50 invariants in 1 ms
[2024-05-31 22:13:00] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-31 22:13:00] [INFO ] Invariant cache hit.
[2024-05-31 22:13:00] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-31 22:13:00] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1291 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-08
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-08 finished in 1359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(!p0))||(F(!p0)&&F(G(!p1))))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 360 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-31 22:13:01] [INFO ] Computed 81 invariants in 4 ms
[2024-05-31 22:13:01] [INFO ] Implicit Places using invariants in 464 ms returned [19, 38, 93, 112, 179, 379, 465]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 469 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 457 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 445 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 444 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 444 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 443 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 443 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 442 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 442 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 441 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 441 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 440 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 440 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 439 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 439 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 438 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 438 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 437 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 437 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 436 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 436 transition count 388
Applied a total of 46 rules in 241 ms. Remains 436 /459 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 436 cols
[2024-05-31 22:13:02] [INFO ] Computed 74 invariants in 3 ms
[2024-05-31 22:13:02] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-31 22:13:02] [INFO ] Invariant cache hit.
[2024-05-31 22:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:13:03] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 436/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2122 ms. Remains : 436/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 367 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-09
Product exploration explored 100000 steps with 1111 reset in 504 ms.
Product exploration explored 100000 steps with 1124 reset in 582 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 20436 steps (234 resets) in 199 ms. (102 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 268 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 369 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 388/388 transitions.
Applied a total of 0 rules in 10 ms. Remains 436 /436 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-05-31 22:13:06] [INFO ] Invariant cache hit.
[2024-05-31 22:13:06] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-31 22:13:06] [INFO ] Invariant cache hit.
[2024-05-31 22:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:13:07] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2024-05-31 22:13:07] [INFO ] Invariant cache hit.
[2024-05-31 22:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 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 Real declared 824/824 variables, and 511 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 387/898 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-05-31 22:13:59] [INFO ] Deduced a trap composed of 215 places in 302 ms of which 52 ms to minimize.
[2024-05-31 22:14:00] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 6 ms to minimize.
[2024-05-31 22:14:01] [INFO ] Deduced a trap composed of 224 places in 169 ms of which 4 ms to minimize.
[2024-05-31 22:14:01] [INFO ] Deduced a trap composed of 233 places in 164 ms of which 4 ms to minimize.
[2024-05-31 22:14:02] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/824 variables, and 903 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 5/5 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Finished structural reductions in LTL mode , in 1 iterations and 61433 ms. Remains : 436/436 places, 388/388 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 26273 steps (300 resets) in 192 ms. (136 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 427 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 378 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1141 reset in 726 ms.
Product exploration explored 100000 steps with 1126 reset in 552 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 377 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 388/388 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 436 transition count 388
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 117 place count 436 transition count 388
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 141 place count 436 transition count 388
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 233 place count 344 transition count 296
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 325 place count 344 transition count 296
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 374 place count 344 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 378 place count 340 transition count 292
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 382 place count 340 transition count 292
Deduced a syphon composed of 94 places in 0 ms
Applied a total of 382 rules in 87 ms. Remains 340 /436 variables (removed 96) and now considering 292/388 (removed 96) transitions.
[2024-05-31 22:14:11] [INFO ] Redundant transitions in 29 ms returned []
Running 291 sub problems to find dead transitions.
// Phase 1: matrix 292 rows 340 cols
[2024-05-31 22:14:11] [INFO ] Computed 74 invariants in 3 ms
[2024-05-31 22:14:11] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-31 22:14:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-31 22:14:17] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 22:14:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 22:14:17] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 22:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-31 22:14:18] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-31 22:14:19] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-31 22:14:19] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 20/94 constraints. Problems are: Problem set: 20 solved, 271 unsolved
[2024-05-31 22:14:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-31 22:14:19] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 3 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-31 22:14:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 3 ms to minimize.
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 5 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 4 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-31 22:14:20] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-31 22:14:21] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-31 22:14:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-31 22:14:21] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 4 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-31 22:14:21] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 4 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-31 22:14:21] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-31 22:14:22] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 4 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-31 22:14:22] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 20/114 constraints. Problems are: Problem set: 39 solved, 252 unsolved
[2024-05-31 22:14:25] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 4 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-31 22:14:25] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-31 22:14:25] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 4 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 4 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 4 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 4 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-31 22:14:26] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
[2024-05-31 22:14:27] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
[2024-05-31 22:14:27] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
[2024-05-31 22:14:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 20/134 constraints. Problems are: Problem set: 82 solved, 209 unsolved
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD176 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 12/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 292/632 variables, 340/486 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 71/557 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 0/557 constraints. Problems are: Problem set: 94 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/632 variables, and 557 constraints, problems are : Problem set: 94 solved, 197 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 340/340 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 94 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 95/340 variables, 74/74 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 72/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 292/632 variables, 340/486 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 71/557 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 197/754 constraints. Problems are: Problem set: 94 solved, 197 unsolved
[2024-05-31 22:15:05] [INFO ] Deduced a trap composed of 120 places in 176 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 1/755 constraints. Problems are: Problem set: 94 solved, 197 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 632/632 variables, and 755 constraints, problems are : Problem set: 94 solved, 197 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 340/340 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/291 constraints, Known Traps: 73/73 constraints]
After SMT, in 60154ms problems are : Problem set: 94 solved, 197 unsolved
Search for dead transitions found 94 dead transitions in 60162ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 340/436 places, 198/388 transitions.
Graph (complete) has 634 edges and 340 vertex of which 246 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.5 ms
Discarding 94 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 246 /340 variables (removed 94) and now considering 198/198 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 246/436 places, 198/388 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60320 ms. Remains : 246/436 places, 198/388 transitions.
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 388/388 transitions.
Applied a total of 0 rules in 25 ms. Remains 436 /436 variables (removed 0) and now considering 388/388 (removed 0) transitions.
// Phase 1: matrix 388 rows 436 cols
[2024-05-31 22:15:11] [INFO ] Computed 74 invariants in 3 ms
[2024-05-31 22:15:12] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-31 22:15:12] [INFO ] Invariant cache hit.
[2024-05-31 22:15:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:15:12] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2024-05-31 22:15:12] [INFO ] Invariant cache hit.
[2024-05-31 22:15:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 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 Real declared 824/824 variables, and 511 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 387/898 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-05-31 22:16:05] [INFO ] Deduced a trap composed of 215 places in 311 ms of which 6 ms to minimize.
[2024-05-31 22:16:05] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 5 ms to minimize.
[2024-05-31 22:16:06] [INFO ] Deduced a trap composed of 224 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:16:06] [INFO ] Deduced a trap composed of 233 places in 139 ms of which 3 ms to minimize.
[2024-05-31 22:16:07] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/824 variables, and 903 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 5/5 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Finished structural reductions in LTL mode , in 1 iterations and 61127 ms. Remains : 436/436 places, 388/388 transitions.
Treatment of property AutoFlight-PT-24a-LTLFireability-09 finished in 192122 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 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 515 transition count 328
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 383 transition count 328
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 264 place count 383 transition count 266
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 388 place count 321 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 390 place count 319 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 500 place count 265 transition count 210
Applied a total of 500 rules in 51 ms. Remains 265 /515 variables (removed 250) and now considering 210/460 (removed 250) transitions.
// Phase 1: matrix 210 rows 265 cols
[2024-05-31 22:16:13] [INFO ] Computed 81 invariants in 1 ms
[2024-05-31 22:16:13] [INFO ] Implicit Places using invariants in 335 ms returned [13, 26, 76, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 197, 264]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 338 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/515 places, 210/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 234 transition count 181
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 205 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 58 place count 205 transition count 178
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 202 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 201 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 201 transition count 177
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 2 with 4 rules applied. Total rules applied 70 place count 199 transition count 175
Applied a total of 70 rules in 12 ms. Remains 199 /234 variables (removed 35) and now considering 175/210 (removed 35) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-31 22:16:13] [INFO ] Computed 50 invariants in 1 ms
[2024-05-31 22:16:13] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-31 22:16:13] [INFO ] Invariant cache hit.
[2024-05-31 22:16:14] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 22:16:14] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1276 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-10
Product exploration explored 100000 steps with 1767 reset in 538 ms.
Product exploration explored 100000 steps with 1769 reset in 559 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 2502 steps (39 resets) in 12 ms. (192 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 103 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-31 22:16:16] [INFO ] Invariant cache hit.
[2024-05-31 22:16:16] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-31 22:16:16] [INFO ] Invariant cache hit.
[2024-05-31 22:16:16] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 22:16:16] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2024-05-31 22:16:16] [INFO ] Redundant transitions in 3 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 22:16:16] [INFO ] Invariant cache hit.
[2024-05-31 22:16:16] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 300 constraints, problems are : Problem set: 0 solved, 174 unsolved in 12702 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 174/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 474 constraints, problems are : Problem set: 0 solved, 174 unsolved in 21495 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 34245ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 34248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35023 ms. Remains : 199/199 places, 175/175 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3286 steps (53 resets) in 16 ms. (193 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1775 reset in 395 ms.
Product exploration explored 100000 steps with 1785 reset in 385 ms.
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-31 22:16:52] [INFO ] Invariant cache hit.
[2024-05-31 22:16:52] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-31 22:16:52] [INFO ] Invariant cache hit.
[2024-05-31 22:16:52] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 22:16:52] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-31 22:16:52] [INFO ] Redundant transitions in 2 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 22:16:52] [INFO ] Invariant cache hit.
[2024-05-31 22:16:52] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 300 constraints, problems are : Problem set: 0 solved, 174 unsolved in 13621 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 174/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 474 constraints, problems are : Problem set: 0 solved, 174 unsolved in 22935 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 36623ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 36627ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37317 ms. Remains : 199/199 places, 175/175 transitions.
Treatment of property AutoFlight-PT-24a-LTLFireability-10 finished in 76509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Applied a total of 46 rules in 230 ms. Remains 492 /515 variables (removed 23) and now considering 437/460 (removed 23) transitions.
// Phase 1: matrix 437 rows 492 cols
[2024-05-31 22:17:29] [INFO ] Computed 81 invariants in 2 ms
[2024-05-31 22:17:30] [INFO ] Implicit Places using invariants in 422 ms returned [19, 38, 93, 112, 179, 196, 405, 491]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 424 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 484/515 places, 437/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 436
Applied a total of 2 rules in 31 ms. Remains 483 /484 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 483 cols
[2024-05-31 22:17:30] [INFO ] Computed 73 invariants in 4 ms
[2024-05-31 22:17:30] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-31 22:17:30] [INFO ] Invariant cache hit.
[2024-05-31 22:17:31] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 483/515 places, 436/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1977 ms. Remains : 483/515 places, 436/460 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5278 steps with 65 reset in 40 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-11 finished in 2201 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(((!p0&&X(F(p1))) U (G((!p0&&F(p1)))||(!p0&&X((!p1&&F(p1)))))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 514 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 514 transition count 459
Applied a total of 2 rules in 35 ms. Remains 514 /515 variables (removed 1) and now considering 459/460 (removed 1) transitions.
// Phase 1: matrix 459 rows 514 cols
[2024-05-31 22:17:31] [INFO ] Computed 81 invariants in 4 ms
[2024-05-31 22:17:32] [INFO ] Implicit Places using invariants in 502 ms returned [38, 93, 112, 179, 196, 427, 513]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 504 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 507/515 places, 459/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 506 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 506 transition count 458
Applied a total of 2 rules in 34 ms. Remains 506 /507 variables (removed 1) and now considering 458/459 (removed 1) transitions.
// Phase 1: matrix 458 rows 506 cols
[2024-05-31 22:17:32] [INFO ] Computed 74 invariants in 4 ms
[2024-05-31 22:17:32] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-31 22:17:32] [INFO ] Invariant cache hit.
[2024-05-31 22:17:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:17:33] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 506/515 places, 458/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1878 ms. Remains : 506/515 places, 458/460 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-12
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-12 finished in 2210 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 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 794 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-31 22:17:34] [INFO ] Computed 81 invariants in 3 ms
[2024-05-31 22:17:35] [INFO ] Implicit Places using invariants in 516 ms returned [19, 38, 93, 112, 179, 196, 379, 465]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 518 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 456 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 435 transition count 388
Applied a total of 46 rules in 305 ms. Remains 435 /458 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 435 cols
[2024-05-31 22:17:35] [INFO ] Computed 73 invariants in 3 ms
[2024-05-31 22:17:36] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-31 22:17:36] [INFO ] Invariant cache hit.
[2024-05-31 22:17:36] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2771 ms. Remains : 435/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-13 finished in 2940 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)&&(p1||G(p2)))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 515 transition count 327
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 382 transition count 327
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 266 place count 382 transition count 267
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 386 place count 322 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 320 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 320 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 391 place count 319 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 313 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 313 transition count 258
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 498 place count 266 transition count 211
Applied a total of 498 rules in 85 ms. Remains 266 /515 variables (removed 249) and now considering 211/460 (removed 249) transitions.
// Phase 1: matrix 211 rows 266 cols
[2024-05-31 22:17:37] [INFO ] Computed 81 invariants in 2 ms
[2024-05-31 22:17:37] [INFO ] Implicit Places using invariants in 527 ms returned [13, 26, 65, 78, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 198, 265]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 529 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/515 places, 211/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 235 transition count 179
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 203 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 202 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 202 transition count 178
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 2 with 4 rules applied. Total rules applied 70 place count 200 transition count 176
Applied a total of 70 rules in 15 ms. Remains 200 /235 variables (removed 35) and now considering 176/211 (removed 35) transitions.
// Phase 1: matrix 176 rows 200 cols
[2024-05-31 22:17:37] [INFO ] Computed 50 invariants in 2 ms
[2024-05-31 22:17:37] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-31 22:17:37] [INFO ] Invariant cache hit.
[2024-05-31 22:17:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 22:17:38] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 200/515 places, 176/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1432 ms. Remains : 200/515 places, 176/460 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 7994 steps with 141 reset in 75 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-15 finished in 1715 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(!p0))||(F(!p0)&&F(G(!p1))))))))'
Found a Shortening insensitive property : AutoFlight-PT-24a-LTLFireability-09
Stuttering acceptance computed with spot in 361 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 515 transition count 327
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 382 transition count 327
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 266 place count 382 transition count 265
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 390 place count 320 transition count 265
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 392 place count 318 transition count 263
Iterating global reduction 2 with 2 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 313 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 313 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 405 place count 312 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 312 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 407 place count 311 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 311 transition count 256
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 502 place count 264 transition count 209
Applied a total of 502 rules in 90 ms. Remains 264 /515 variables (removed 251) and now considering 209/460 (removed 251) transitions.
// Phase 1: matrix 209 rows 264 cols
[2024-05-31 22:17:39] [INFO ] Computed 81 invariants in 2 ms
[2024-05-31 22:17:39] [INFO ] Implicit Places using invariants in 459 ms returned [13, 27, 65, 78, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 128, 196, 263]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 466 ms to find 31 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 233/515 places, 209/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 233 transition count 178
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 202 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 62 place count 202 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 201 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 200 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 200 transition count 176
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 2 with 4 rules applied. Total rules applied 70 place count 198 transition count 174
Applied a total of 70 rules in 22 ms. Remains 198 /233 variables (removed 35) and now considering 174/209 (removed 35) transitions.
// Phase 1: matrix 174 rows 198 cols
[2024-05-31 22:17:40] [INFO ] Computed 50 invariants in 1 ms
[2024-05-31 22:17:40] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-31 22:17:40] [INFO ] Invariant cache hit.
[2024-05-31 22:17:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-31 22:17:40] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/515 places, 174/460 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1403 ms. Remains : 198/515 places, 174/460 transitions.
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-09
Product exploration explored 100000 steps with 1808 reset in 642 ms.
Product exploration explored 100000 steps with 1807 reset in 481 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 6753 steps (113 resets) in 60 ms. (110 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 363 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-31 22:17:43] [INFO ] Invariant cache hit.
[2024-05-31 22:17:43] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-31 22:17:43] [INFO ] Invariant cache hit.
[2024-05-31 22:17:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-31 22:17:44] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-31 22:17:44] [INFO ] Invariant cache hit.
[2024-05-31 22:17:44] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:17:46] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 296 constraints, problems are : Problem set: 0 solved, 173 unsolved in 14605 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 173/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 469 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
After SMT, in 44695ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 44698ms
Finished structural reductions in LTL mode , in 1 iterations and 45457 ms. Remains : 198/198 places, 174/174 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 8851 steps (153 resets) in 62 ms. (140 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 240 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 245 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1803 reset in 393 ms.
Product exploration explored 100000 steps with 1795 reset in 521 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-31 22:18:31] [INFO ] Redundant transitions in 0 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-31 22:18:31] [INFO ] Invariant cache hit.
[2024-05-31 22:18:31] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:18:34] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 296 constraints, problems are : Problem set: 0 solved, 173 unsolved in 16514 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 173/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 469 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
After SMT, in 46567ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 46569ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46581 ms. Remains : 198/198 places, 174/174 transitions.
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 174/174 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-31 22:19:18] [INFO ] Invariant cache hit.
[2024-05-31 22:19:18] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-31 22:19:18] [INFO ] Invariant cache hit.
[2024-05-31 22:19:18] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-31 22:19:18] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-31 22:19:18] [INFO ] Invariant cache hit.
[2024-05-31 22:19:18] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 296 constraints, problems are : Problem set: 0 solved, 173 unsolved in 16659 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 173/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 469 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
After SMT, in 46736ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 46739ms
Finished structural reductions in LTL mode , in 1 iterations and 47340 ms. Remains : 198/198 places, 174/174 transitions.
Treatment of property AutoFlight-PT-24a-LTLFireability-09 finished in 146640 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)))'
[2024-05-31 22:20:05] [INFO ] Flatten gal took : 55 ms
[2024-05-31 22:20:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-31 22:20:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 460 transitions and 1306 arcs took 11 ms.
Total runtime 478537 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : AutoFlight-PT-24a-LTLFireability-06
Could not compute solution for formula : AutoFlight-PT-24a-LTLFireability-09
Could not compute solution for formula : AutoFlight-PT-24a-LTLFireability-10

BK_STOP 1717194615234

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-24a-LTLFireability-06
ltl formula formula --ltl=/tmp/2065/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 515 places, 460 transitions and 1306 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2065/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2065/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2065/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2065/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 516 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 516, there are 472 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~78 levels ~10000 states ~70468 transitions
pnml2lts-mc( 2/ 4): ~78 levels ~20000 states ~132276 transitions
pnml2lts-mc( 2/ 4): ~78 levels ~40000 states ~266144 transitions
pnml2lts-mc( 2/ 4): ~78 levels ~80000 states ~554356 transitions
pnml2lts-mc( 2/ 4): ~78 levels ~160000 states ~1171568 transitions
pnml2lts-mc( 2/ 4): ~78 levels ~320000 states ~2485104 transitions
pnml2lts-mc( 3/ 4): ~77 levels ~640000 states ~5271624 transitions
pnml2lts-mc( 3/ 4): ~77 levels ~1280000 states ~11166288 transitions
pnml2lts-mc( 3/ 4): ~77 levels ~2560000 states ~23596216 transitions
pnml2lts-mc( 3/ 4): ~77 levels ~5120000 states ~49735680 transitions
pnml2lts-mc( 3/ 4): ~77 levels ~10240000 states ~104574792 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16602246
pnml2lts-mc( 0/ 4): unique states count: 16602498
pnml2lts-mc( 0/ 4): unique transitions count: 177967255
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 161348751
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 16602504
pnml2lts-mc( 0/ 4): - cum. max stack depth: 311
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16602504 states 177967852 transitions, fanout: 10.719
pnml2lts-mc( 0/ 4): Total exploration time 262.810 sec (262.800 sec minimum, 262.802 sec on average)
pnml2lts-mc( 0/ 4): States per second: 63173, Transitions per second: 677173
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 190.7MB, 12.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 49.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 463 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 190.7MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-24a-LTLFireability-09
ltl formula formula --ltl=/tmp/2065/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 515 places, 460 transitions and 1306 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2065/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2065/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2065/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2065/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 516 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 516, there are 481 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~78 levels ~10000 states ~61636 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~20000 states ~123012 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~40000 states ~149040 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~80000 states ~308096 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~160000 states ~646496 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~320000 states ~1363520 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~640000 states ~2877024 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~1280000 states ~6064256 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~2560000 states ~12758944 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~5120000 states ~26788592 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~10240000 states ~56128032 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9031329
pnml2lts-mc( 0/ 4): unique states count: 11306356
pnml2lts-mc( 0/ 4): unique transitions count: 88449732
pnml2lts-mc( 0/ 4): - self-loop count: 34
pnml2lts-mc( 0/ 4): - claim dead count: 67120200
pnml2lts-mc( 0/ 4): - claim found count: 8493400
pnml2lts-mc( 0/ 4): - claim success count: 11306362
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2087342
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11306362 states 88450031 transitions, fanout: 7.823
pnml2lts-mc( 0/ 4): Total exploration time 176.300 sec (176.280 sec minimum, 176.290 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64131, Transitions per second: 501702
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 161.1MB, 13.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 37.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 463 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 161.1MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-24a-LTLFireability-10
ltl formula formula --ltl=/tmp/2065/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 515 places, 460 transitions and 1306 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2065/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2065/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2065/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2065/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 517 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 516, there are 469 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~78 levels ~10000 states ~63260 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~20000 states ~126596 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~40000 states ~263516 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~80000 states ~557756 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~160000 states ~1186676 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~320000 states ~2523560 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~640000 states ~5357452 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~1280000 states ~11345300 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~2560000 states ~23961212 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~5120000 states ~50473096 transitions
pnml2lts-mc( 2/ 4): ~78 levels ~10240000 states ~106061648 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11111448
pnml2lts-mc( 0/ 4): unique states count: 11111710
pnml2lts-mc( 0/ 4): unique transitions count: 116256772
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 105134536
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 11111716
pnml2lts-mc( 0/ 4): - cum. max stack depth: 312
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11111716 states 116257072 transitions, fanout: 10.463
pnml2lts-mc( 0/ 4): Total exploration time 168.370 sec (168.350 sec minimum, 168.355 sec on average)
pnml2lts-mc( 0/ 4): States per second: 65996, Transitions per second: 690486
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 148.9MB, 14.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 33.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 463 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 148.9MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-24a, 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 r468-smll-171620167100172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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