Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729600579.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is AutoFlight-PT-48b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729600579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 956K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-48b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748640242376

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 21:24:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 21:24:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 21:24:03] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2025-05-30 21:24:03] [INFO ] Transformed 3950 places.
[2025-05-30 21:24:03] [INFO ] Transformed 3936 transitions.
[2025-05-30 21:24:03] [INFO ] Found NUPN structural information;
[2025-05-30 21:24:04] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-48b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 3950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Discarding 501 places :
Symmetric choice reduction at 0 with 501 rule applications. Total rules 501 place count 3449 transition count 3435
Iterating global reduction 0 with 501 rules applied. Total rules applied 1002 place count 3449 transition count 3435
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 1074 place count 3449 transition count 3363
Discarding 233 places :
Symmetric choice reduction at 1 with 233 rule applications. Total rules 1307 place count 3216 transition count 3130
Iterating global reduction 1 with 233 rules applied. Total rules applied 1540 place count 3216 transition count 3130
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 1574 place count 3182 transition count 3096
Iterating global reduction 1 with 34 rules applied. Total rules applied 1608 place count 3182 transition count 3096
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 1642 place count 3148 transition count 3062
Iterating global reduction 1 with 34 rules applied. Total rules applied 1676 place count 3148 transition count 3062
Applied a total of 1676 rules in 2162 ms. Remains 3148 /3950 variables (removed 802) and now considering 3062/3936 (removed 874) transitions.
// Phase 1: matrix 3062 rows 3148 cols
[2025-05-30 21:24:06] [INFO ] Computed 258 invariants in 64 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:24:08] [INFO ] Implicit Places using invariants in 2197 ms returned []
[2025-05-30 21:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:24:14] [INFO ] Implicit Places using invariants and state equation in 6142 ms returned []
Implicit Place search using SMT with State Equation took 8388 ms to find 0 implicit places.
Running 3061 sub problems to find dead transitions.
[2025-05-30 21:24:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3147/6210 variables, and 0 constraints, problems are : Problem set: 0 solved, 3061 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3148 constraints, PredecessorRefiner: 3061/3061 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3061 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3147/6210 variables, and 0 constraints, problems are : Problem set: 0 solved, 3061 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3148 constraints, PredecessorRefiner: 0/3061 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61241ms problems are : Problem set: 0 solved, 3061 unsolved
Search for dead transitions found 0 dead transitions in 61267ms
Starting structural reductions in LTL mode, iteration 1 : 3148/3950 places, 3062/3936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71855 ms. Remains : 3148/3950 places, 3062/3936 transitions.
Support contains 31 out of 3148 places after structural reductions.
[2025-05-30 21:25:16] [INFO ] Flatten gal took : 187 ms
[2025-05-30 21:25:16] [INFO ] Flatten gal took : 115 ms
[2025-05-30 21:25:16] [INFO ] Input system was already deterministic with 3062 transitions.
RANDOM walk for 40000 steps (20 resets) in 1316 ms. (30 steps per ms) remains 6/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 112 ms. (353 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
[2025-05-30 21:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1177/1191 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1836/3027 variables, 168/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3027 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 121/3148 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3148 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3062/6210 variables, 3148/3406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6210 variables, 0/3406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/6210 variables, 0/3406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6210/6210 variables, and 3406 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4133 ms.
Refiners :[Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 3148/3148 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1177/1191 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:25:22] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1191 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1836/3027 variables, 168/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:25:24] [INFO ] Deduced a trap composed of 63 places in 585 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:25:25] [INFO ] Deduced a trap composed of 111 places in 659 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:25:25] [INFO ] Deduced a trap composed of 182 places in 223 ms of which 47 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3027 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3027/6210 variables, and 261 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3148 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9175ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 3148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1260 transitions
Trivial Post-agglo rules discarded 1260 transitions
Performed 1260 trivial Post agglomeration. Transition count delta: 1260
Iterating post reduction 0 with 1260 rules applied. Total rules applied 1260 place count 3148 transition count 1802
Reduce places removed 1260 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1405 rules applied. Total rules applied 2665 place count 1888 transition count 1657
Reduce places removed 96 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 100 rules applied. Total rules applied 2765 place count 1792 transition count 1653
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2769 place count 1788 transition count 1653
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 352 Pre rules applied. Total rules applied 2769 place count 1788 transition count 1301
Deduced a syphon composed of 352 places in 7 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 3473 place count 1436 transition count 1301
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 3478 place count 1431 transition count 1296
Iterating global reduction 4 with 5 rules applied. Total rules applied 3483 place count 1431 transition count 1296
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 3483 place count 1431 transition count 1292
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3491 place count 1427 transition count 1292
Performed 565 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 565 places in 1 ms
Reduce places removed 565 places and 0 transitions.
Iterating global reduction 4 with 1130 rules applied. Total rules applied 4621 place count 862 transition count 657
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4622 place count 862 transition count 656
Free-agglomeration rule applied 144 times.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4766 place count 862 transition count 512
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 4910 place count 718 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4911 place count 717 transition count 511
Reduce places removed 33 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 5 with 48 rules applied. Total rules applied 4959 place count 684 transition count 496
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 4974 place count 669 transition count 496
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 4974 place count 669 transition count 478
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 5010 place count 651 transition count 478
Applied a total of 5010 rules in 603 ms. Remains 651 /3148 variables (removed 2497) and now considering 478/3062 (removed 2584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 651/3148 places, 478/3062 transitions.
RANDOM walk for 40000 steps (8 resets) in 776 ms. (51 steps per ms) remains 1/6 properties
BEST_FIRST walk for 28728 steps (6 resets) in 176 ms. (162 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-48b-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-48b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 805 stabilizing places and 805 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&F(p0))))'
Support contains 2 out of 3148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1271 transitions
Trivial Post-agglo rules discarded 1271 transitions
Performed 1271 trivial Post agglomeration. Transition count delta: 1271
Iterating post reduction 0 with 1271 rules applied. Total rules applied 1271 place count 3147 transition count 1790
Reduce places removed 1271 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1417 rules applied. Total rules applied 2688 place count 1876 transition count 1644
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2785 place count 1780 transition count 1643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2786 place count 1779 transition count 1643
Performed 354 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 354 Pre rules applied. Total rules applied 2786 place count 1779 transition count 1289
Deduced a syphon composed of 354 places in 7 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 4 with 708 rules applied. Total rules applied 3494 place count 1425 transition count 1289
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 3502 place count 1417 transition count 1281
Iterating global reduction 4 with 8 rules applied. Total rules applied 3510 place count 1417 transition count 1281
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 3510 place count 1417 transition count 1276
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 3520 place count 1412 transition count 1276
Performed 566 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 566 places in 0 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 4 with 1132 rules applied. Total rules applied 4652 place count 846 transition count 640
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4653 place count 845 transition count 639
Reduce places removed 93 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 4 with 138 rules applied. Total rules applied 4791 place count 752 transition count 594
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 5 with 45 rules applied. Total rules applied 4836 place count 707 transition count 594
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4836 place count 707 transition count 546
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4932 place count 659 transition count 546
Applied a total of 4932 rules in 384 ms. Remains 659 /3148 variables (removed 2489) and now considering 546/3062 (removed 2516) transitions.
// Phase 1: matrix 546 rows 659 cols
[2025-05-30 21:25:28] [INFO ] Computed 165 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:25:28] [INFO ] Implicit Places using invariants in 340 ms returned [260, 336, 374, 448, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 579, 583, 585, 587, 589, 591, 593, 595, 598, 600, 602, 604, 606, 608, 612, 616, 620, 624, 628, 632, 636, 640, 644, 648, 653, 658]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 343 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 606/3148 places, 546/3062 transitions.
Graph (trivial) has 248 edges and 606 vertex of which 12 / 606 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 555 transition count 485
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 555 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 553 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 553 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 551 transition count 481
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 551 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 549 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 549 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 547 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 547 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 545 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 545 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 543 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 543 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 541 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 541 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 539 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 539 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 537 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 537 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 535 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 535 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 533 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 533 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 531 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 531 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 530 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 530 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 529 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 529 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 528 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 528 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 527 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 527 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 526 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 526 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 525 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 525 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 524 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 524 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 523 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 523 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 522 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 522 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 521 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 521 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 520 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 520 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 519 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 519 transition count 449
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 155 place count 518 transition count 448
Applied a total of 155 rules in 437 ms. Remains 518 /606 variables (removed 88) and now considering 448/546 (removed 98) transitions.
// Phase 1: matrix 448 rows 518 cols
[2025-05-30 21:25:29] [INFO ] Computed 112 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:25:29] [INFO ] Implicit Places using invariants in 852 ms returned []
[2025-05-30 21:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:25:30] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-30 21:25:36] [INFO ] Implicit Places using invariants and state equation in 6869 ms returned []
Implicit Place search using SMT with State Equation took 7743 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 518/3148 places, 448/3062 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8911 ms. Remains : 518/3148 places, 448/3062 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLCardinality-02 finished in 9162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3138 transition count 3052
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3138 transition count 3052
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 3133 transition count 3047
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3132 transition count 3046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3131 transition count 3045
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3131 transition count 3045
Applied a total of 34 rules in 1576 ms. Remains 3131 /3148 variables (removed 17) and now considering 3045/3062 (removed 17) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2025-05-30 21:25:38] [INFO ] Computed 258 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:25:40] [INFO ] Implicit Places using invariants in 1698 ms returned []
[2025-05-30 21:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:25:45] [INFO ] Implicit Places using invariants and state equation in 5618 ms returned []
Implicit Place search using SMT with State Equation took 7326 ms to find 0 implicit places.
Running 3044 sub problems to find dead transitions.
[2025-05-30 21:25:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3130/6176 variables, and 0 constraints, problems are : Problem set: 0 solved, 3044 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3131 constraints, PredecessorRefiner: 3044/3044 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3044 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3130/6176 variables, and 0 constraints, problems are : Problem set: 0 solved, 3044 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3131 constraints, PredecessorRefiner: 0/3044 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60939ms problems are : Problem set: 0 solved, 3044 unsolved
Search for dead transitions found 0 dead transitions in 60948ms
Starting structural reductions in LTL mode, iteration 1 : 3131/3148 places, 3045/3062 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69861 ms. Remains : 3131/3148 places, 3045/3062 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 764 ms.
Product exploration explored 100000 steps with 50000 reset in 770 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 31 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLCardinality-03 finished in 71720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p2)&&p1)))'
Support contains 8 out of 3148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3141 transition count 3055
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3141 transition count 3055
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 3138 transition count 3052
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 3138 transition count 3052
Applied a total of 20 rules in 1018 ms. Remains 3138 /3148 variables (removed 10) and now considering 3052/3062 (removed 10) transitions.
// Phase 1: matrix 3052 rows 3138 cols
[2025-05-30 21:26:49] [INFO ] Computed 258 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:26:51] [INFO ] Implicit Places using invariants in 1727 ms returned []
[2025-05-30 21:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:26:57] [INFO ] Implicit Places using invariants and state equation in 6293 ms returned []
Implicit Place search using SMT with State Equation took 8027 ms to find 0 implicit places.
Running 3051 sub problems to find dead transitions.
[2025-05-30 21:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3137/6190 variables, and 0 constraints, problems are : Problem set: 0 solved, 3051 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3138 constraints, PredecessorRefiner: 3051/3051 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3051 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3137/6190 variables, and 0 constraints, problems are : Problem set: 0 solved, 3051 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3138 constraints, PredecessorRefiner: 0/3051 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 3051 unsolved
Search for dead transitions found 0 dead transitions in 61107ms
Starting structural reductions in LTL mode, iteration 1 : 3138/3148 places, 3052/3062 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70167 ms. Remains : 3138/3148 places, 3052/3062 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1573 steps with 0 reset in 11 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLCardinality-04 finished in 70439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3138 transition count 3052
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3138 transition count 3052
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 3133 transition count 3047
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3132 transition count 3046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3131 transition count 3045
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3131 transition count 3045
Applied a total of 34 rules in 1580 ms. Remains 3131 /3148 variables (removed 17) and now considering 3045/3062 (removed 17) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2025-05-30 21:28:00] [INFO ] Computed 258 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:28:02] [INFO ] Implicit Places using invariants in 1757 ms returned []
[2025-05-30 21:28:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:28:08] [INFO ] Implicit Places using invariants and state equation in 5952 ms returned []
Implicit Place search using SMT with State Equation took 7713 ms to find 0 implicit places.
Running 3044 sub problems to find dead transitions.
[2025-05-30 21:28:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 timeout
1.0)
(s1217 1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3130/6176 variables, and 0 constraints, problems are : Problem set: 0 solved, 3044 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3131 constraints, PredecessorRefiner: 3044/3044 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3044 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3130/6176 variables, and 0 constraints, problems are : Problem set: 0 solved, 3044 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3131 constraints, PredecessorRefiner: 0/3044 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60971ms problems are : Problem set: 0 solved, 3044 unsolved
Search for dead transitions found 0 dead transitions in 60978ms
Starting structural reductions in LTL mode, iteration 1 : 3131/3148 places, 3045/3062 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70281 ms. Remains : 3131/3148 places, 3045/3062 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 690 ms.
Product exploration explored 100000 steps with 50000 reset in 697 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 10 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLCardinality-05 finished in 71887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(G(p1))&&G(p2))))'
Support contains 6 out of 3148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3139 transition count 3053
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3139 transition count 3053
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 3136 transition count 3050
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 3136 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3135 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3135 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3134 transition count 3048
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3134 transition count 3048
Applied a total of 28 rules in 1611 ms. Remains 3134 /3148 variables (removed 14) and now considering 3048/3062 (removed 14) transitions.
// Phase 1: matrix 3048 rows 3134 cols
[2025-05-30 21:29:12] [INFO ] Computed 258 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:29:14] [INFO ] Implicit Places using invariants in 1670 ms returned []
[2025-05-30 21:29:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:29:20] [INFO ] Implicit Places using invariants and state equation in 5744 ms returned []
Implicit Place search using SMT with State Equation took 7452 ms to find 0 implicit places.
Running 3047 sub problems to find dead transitions.
[2025-05-30 21:29:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3133/6182 variables, and 0 constraints, problems are : Problem set: 0 solved, 3047 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3134 constraints, PredecessorRefiner: 3047/3047 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3047 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3133/6182 variables, and 0 constraints, problems are : Problem set: 0 solved, 3047 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3134 constraints, PredecessorRefiner: 0/3047 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60902ms problems are : Problem set: 0 solved, 3047 unsolved
Search for dead transitions found 0 dead transitions in 60918ms
Starting structural reductions in LTL mode, iteration 1 : 3134/3148 places, 3048/3062 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69987 ms. Remains : 3134/3148 places, 3048/3062 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 705 ms.
Product exploration explored 100000 steps with 50000 reset in 683 ms.
Computed a total of 794 stabilizing places and 794 stable transitions
Computed a total of 794 stabilizing places and 794 stable transitions
Detected a total of 794/3134 stabilizing places and 794/3048 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 29 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLCardinality-06 finished in 71685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1273 transitions
Trivial Post-agglo rules discarded 1273 transitions
Performed 1273 trivial Post agglomeration. Transition count delta: 1273
Iterating post reduction 0 with 1273 rules applied. Total rules applied 1273 place count 3147 transition count 1788
Reduce places removed 1273 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1419 rules applied. Total rules applied 2692 place count 1874 transition count 1642
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2789 place count 1778 transition count 1641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2790 place count 1777 transition count 1641
Performed 354 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 354 Pre rules applied. Total rules applied 2790 place count 1777 transition count 1287
Deduced a syphon composed of 354 places in 27 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 4 with 708 rules applied. Total rules applied 3498 place count 1423 transition count 1287
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 3506 place count 1415 transition count 1279
Iterating global reduction 4 with 8 rules applied. Total rules applied 3514 place count 1415 transition count 1279
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 3514 place count 1415 transition count 1274
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 3524 place count 1410 transition count 1274
Performed 567 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 567 places in 0 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 4 with 1134 rules applied. Total rules applied 4658 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4659 place count 842 transition count 636
Reduce places removed 92 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 136 rules applied. Total rules applied 4795 place count 750 transition count 592
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 4839 place count 706 transition count 592
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4839 place count 706 transition count 544
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4935 place count 658 transition count 544
Applied a total of 4935 rules in 453 ms. Remains 658 /3148 variables (removed 2490) and now considering 544/3062 (removed 2518) transitions.
// Phase 1: matrix 544 rows 658 cols
[2025-05-30 21:30:23] [INFO ] Computed 166 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:30:23] [INFO ] Implicit Places using invariants in 424 ms returned [260, 334, 372, 446, 484, 488, 492, 496, 500, 504, 508, 512, 516, 520, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 581, 583, 585, 587, 589, 591, 593, 596, 598, 600, 602, 604, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 647, 652, 657]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 440 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/3148 places, 544/3062 transitions.
Graph (trivial) has 248 edges and 605 vertex of which 12 / 605 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 554 transition count 483
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 554 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 552 transition count 481
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 552 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 550 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 550 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 548 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 548 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 546 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 546 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 544 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 544 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 542 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 542 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 540 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 540 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 538 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 538 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 536 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 536 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 534 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 534 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 532 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 532 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 530 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 530 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 529 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 529 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 528 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 528 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 527 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 527 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 526 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 526 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 525 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 525 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 524 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 524 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 523 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 523 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 522 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 522 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 521 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 521 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 520 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 520 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 519 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 519 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 518 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 518 transition count 447
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 155 place count 517 transition count 446
Applied a total of 155 rules in 399 ms. Remains 517 /605 variables (removed 88) and now considering 446/544 (removed 98) transitions.
// Phase 1: matrix 446 rows 517 cols
[2025-05-30 21:30:24] [INFO ] Computed 113 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:30:24] [INFO ] Implicit Places using invariants in 898 ms returned []
[2025-05-30 21:30:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:30:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 21:30:26] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 517/3148 places, 446/3062 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3406 ms. Remains : 517/3148 places, 446/3062 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-07
Product exploration explored 100000 steps with 871 reset in 606 ms.
Product exploration explored 100000 steps with 867 reset in 718 ms.
Computed a total of 6 stabilizing places and 3 stable transitions
Computed a total of 6 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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)]
RANDOM walk for 8293 steps (69 resets) in 183 ms. (45 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 164 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 446/446 transitions.
Applied a total of 0 rules in 17 ms. Remains 517 /517 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-05-30 21:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:30:29] [INFO ] Implicit Places using invariants in 926 ms returned []
[2025-05-30 21:30:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:30:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 21:30:30] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:30:30] [INFO ] Redundant transitions in 23 ms returned []
Running 260 sub problems to find dead transitions.
[2025-05-30 21:30:30] [INFO ] Invariant cache hit.
[2025-05-30 21:30:30] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:30:39] [INFO ] Deduced a trap composed of 256 places in 180 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 445/962 variables, 517/631 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/962 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/963 variables, and 634 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, State Equation: 517/517 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 445/962 variables, 517/631 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/962 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/962 variables, 260/894 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/963 variables, and 894 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, State Equation: 517/517 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62310 ms. Remains : 517/517 places, 446/446 transitions.
Computed a total of 6 stabilizing places and 3 stable transitions
Computed a total of 6 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19941 steps (169 resets) in 168 ms. (117 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 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 869 reset in 515 ms.
Product exploration explored 100000 steps with 874 reset in 562 ms.
Built C files in :
/tmp/ltsmin5156574088670217263
[2025-05-30 21:31:32] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2025-05-30 21:31:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:31:32] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2025-05-30 21:31:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:31:32] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2025-05-30 21:31:32] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:31:32] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5156574088670217263
Running compilation step : cd /tmp/ltsmin5156574088670217263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1086 ms.
Running link step : cd /tmp/ltsmin5156574088670217263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5156574088670217263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12360938842602825998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 446/446 transitions.
Applied a total of 0 rules in 18 ms. Remains 517 /517 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2025-05-30 21:31:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:31:48] [INFO ] Implicit Places using invariants in 800 ms returned []
[2025-05-30 21:31:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:31:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 21:31:49] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:31:49] [INFO ] Redundant transitions in 12 ms returned []
Running 260 sub problems to find dead transitions.
[2025-05-30 21:31:49] [INFO ] Invariant cache hit.
[2025-05-30 21:31:49] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:31:58] [INFO ] Deduced a trap composed of 256 places in 151 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 445/962 variables, 517/631 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/962 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/963 variables, and 634 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, State Equation: 517/517 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 445/962 variables, 517/631 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/962 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/962 variables, 260/894 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/963 variables, and 894 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, State Equation: 517/517 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62128 ms. Remains : 517/517 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin7924264921438261888
[2025-05-30 21:32:49] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2025-05-30 21:32:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:32:49] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2025-05-30 21:32:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:32:49] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2025-05-30 21:32:49] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:32:49] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7924264921438261888
Running compilation step : cd /tmp/ltsmin7924264921438261888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 952 ms.
Running link step : cd /tmp/ltsmin7924264921438261888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7924264921438261888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15614377853212266358.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 21:33:04] [INFO ] Flatten gal took : 15 ms
[2025-05-30 21:33:04] [INFO ] Flatten gal took : 14 ms
[2025-05-30 21:33:04] [INFO ] Time to serialize gal into /tmp/LTL16370541644863952478.gal : 5 ms
[2025-05-30 21:33:04] [INFO ] Time to serialize properties into /tmp/LTL15070436397914592696.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16370541644863952478.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11086520529786937152.hoa' '-atoms' '/tmp/LTL15070436397914592696.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15070436397914592696.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11086520529786937152.hoa
Detected timeout of ITS tools.
[2025-05-30 21:33:19] [INFO ] Flatten gal took : 13 ms
[2025-05-30 21:33:19] [INFO ] Flatten gal took : 13 ms
[2025-05-30 21:33:19] [INFO ] Time to serialize gal into /tmp/LTL9763908905210146306.gal : 3 ms
[2025-05-30 21:33:19] [INFO ] Time to serialize properties into /tmp/LTL10977038576031500524.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9763908905210146306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10977038576031500524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2589==0)||(p2390==1))"))))
Formula 0 simplified : FG!"((p2589==0)||(p2390==1))"
Detected timeout of ITS tools.
[2025-05-30 21:33:34] [INFO ] Flatten gal took : 14 ms
[2025-05-30 21:33:34] [INFO ] Applying decomposition
[2025-05-30 21:33:34] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11491338124603104419.txt' '-o' '/tmp/graph11491338124603104419.bin' '-w' '/tmp/graph11491338124603104419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11491338124603104419.bin' '-l' '-1' '-v' '-w' '/tmp/graph11491338124603104419.weights' '-q' '0' '-e' '0.001'
[2025-05-30 21:33:35] [INFO ] Decomposing Gal with order
[2025-05-30 21:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 21:33:35] [INFO ] Removed a total of 7 redundant transitions.
[2025-05-30 21:33:35] [INFO ] Flatten gal took : 73 ms
[2025-05-30 21:33:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-05-30 21:33:35] [INFO ] Time to serialize gal into /tmp/LTL12628497004936140076.gal : 8 ms
[2025-05-30 21:33:35] [INFO ] Time to serialize properties into /tmp/LTL12840101551682049727.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12628497004936140076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12840101551682049727.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u136.p2589==0)||(i8.u109.p2390==1))"))))
Formula 0 simplified : FG!"((i1.u136.p2589==0)||(i8.u109.p2390==1))"
Reverse transition relation is NOT exact ! Due to transitions t380_t630, t526_t630, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 7.80653e+13 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
73 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.783815,54948,1,0,81494,34692,5524,89832,1845,127415,90659
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-48b-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-48b-LTLCardinality-07 finished in 193421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1273 transitions
Trivial Post-agglo rules discarded 1273 transitions
Performed 1273 trivial Post agglomeration. Transition count delta: 1273
Iterating post reduction 0 with 1273 rules applied. Total rules applied 1273 place count 3147 transition count 1788
Reduce places removed 1273 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1418 rules applied. Total rules applied 2691 place count 1874 transition count 1643
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2787 place count 1778 transition count 1643
Performed 354 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 354 Pre rules applied. Total rules applied 2787 place count 1778 transition count 1289
Deduced a syphon composed of 354 places in 6 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 3 with 708 rules applied. Total rules applied 3495 place count 1424 transition count 1289
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3502 place count 1417 transition count 1282
Iterating global reduction 3 with 7 rules applied. Total rules applied 3509 place count 1417 transition count 1282
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 3509 place count 1417 transition count 1278
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3517 place count 1413 transition count 1278
Performed 567 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 567 places in 0 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4651 place count 846 transition count 641
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4652 place count 846 transition count 641
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4653 place count 845 transition count 640
Reduce places removed 93 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 3 with 138 rules applied. Total rules applied 4791 place count 752 transition count 595
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 4836 place count 707 transition count 595
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4836 place count 707 transition count 547
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4932 place count 659 transition count 547
Applied a total of 4932 rules in 358 ms. Remains 659 /3148 variables (removed 2489) and now considering 547/3062 (removed 2515) transitions.
// Phase 1: matrix 547 rows 659 cols
[2025-05-30 21:33:36] [INFO ] Computed 165 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:36] [INFO ] Implicit Places using invariants in 425 ms returned [262, 336, 374, 448, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 579, 583, 585, 587, 589, 591, 593, 595, 598, 600, 602, 604, 606, 608, 612, 616, 620, 624, 628, 632, 636, 640, 644, 648, 653, 658]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 429 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 606/3148 places, 547/3062 transitions.
Graph (trivial) has 248 edges and 606 vertex of which 12 / 606 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 555 transition count 486
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 555 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 553 transition count 484
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 553 transition count 484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 551 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 551 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 549 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 549 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 547 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 547 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 545 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 545 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 543 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 543 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 541 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 541 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 539 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 539 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 537 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 537 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 535 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 535 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 533 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 533 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 531 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 531 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 530 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 530 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 529 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 529 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 528 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 528 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 527 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 527 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 526 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 526 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 525 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 525 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 524 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 524 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 523 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 523 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 522 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 522 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 521 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 521 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 520 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 520 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 519 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 519 transition count 450
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 155 place count 518 transition count 449
Applied a total of 155 rules in 229 ms. Remains 518 /606 variables (removed 88) and now considering 449/547 (removed 98) transitions.
// Phase 1: matrix 449 rows 518 cols
[2025-05-30 21:33:37] [INFO ] Computed 112 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:38] [INFO ] Implicit Places using invariants in 852 ms returned []
[2025-05-30 21:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-30 21:33:39] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2525 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 518/3148 places, 449/3062 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3543 ms. Remains : 518/3148 places, 449/3062 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-13
Product exploration explored 100000 steps with 856 reset in 457 ms.
Product exploration explored 100000 steps with 855 reset in 507 ms.
Computed a total of 8 stabilizing places and 5 stable transitions
Computed a total of 8 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 40000 steps (341 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 584695 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 584695 steps, saw 86390 distinct states, run finished after 3007 ms. (steps per millisecond=194 ) properties seen :0
[2025-05-30 21:33:44] [INFO ] Invariant cache hit.
[2025-05-30 21:33:44] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/137 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/267 variables, 40/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 11/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 216/483 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 196/679 variables, 228/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/679 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/679 variables, 17/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 287/966 variables, 184/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/966 variables, 79/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/966 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/966 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 966/967 variables, and 658 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/137 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/267 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:44] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 216/483 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/483 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/483 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 196/679 variables, 228/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 6/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/679 variables, 17/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/679 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 287/966 variables, 184/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/966 variables, 79/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/966 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/966 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 966/967 variables, and 660 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 883ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 449/449 transitions.
Applied a total of 0 rules in 16 ms. Remains 518 /518 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2025-05-30 21:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:46] [INFO ] Implicit Places using invariants in 868 ms returned []
[2025-05-30 21:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:33:46] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-30 21:33:47] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:33:47] [INFO ] Redundant transitions in 9 ms returned []
Running 295 sub problems to find dead transitions.
[2025-05-30 21:33:47] [INFO ] Invariant cache hit.
[2025-05-30 21:33:47] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 2/518 variables, 26/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:55] [INFO ] Deduced a trap composed of 210 places in 131 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:55] [INFO ] Deduced a trap composed of 211 places in 129 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:56] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:56] [INFO ] Deduced a trap composed of 157 places in 203 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:57] [INFO ] Deduced a trap composed of 172 places in 166 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:57] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:33:59] [INFO ] Deduced a trap composed of 255 places in 178 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 448/966 variables, 518/637 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/966 variables, 28/665 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/967 variables, and 665 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 2/518 variables, 26/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 448/966 variables, 518/637 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/966 variables, 28/665 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/966 variables, 295/960 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/967 variables, and 960 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62630 ms. Remains : 518/518 places, 449/449 transitions.
Computed a total of 8 stabilizing places and 5 stable transitions
Computed a total of 8 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (337 resets) in 436 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 591822 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 591822 steps, saw 87046 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2025-05-30 21:34:51] [INFO ] Invariant cache hit.
[2025-05-30 21:34:51] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/137 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/267 variables, 40/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 11/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 216/483 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 196/679 variables, 228/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/679 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/679 variables, 17/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 287/966 variables, 184/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/966 variables, 79/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/966 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/966 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 966/967 variables, and 658 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/137 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/267 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:51] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 216/483 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/483 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/483 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 196/679 variables, 228/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 6/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/679 variables, 17/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/679 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 287/966 variables, 184/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/966 variables, 79/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/966 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/966 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 966/967 variables, and 660 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 853 reset in 440 ms.
Product exploration explored 100000 steps with 852 reset in 494 ms.
Built C files in :
/tmp/ltsmin13751577942451201728
[2025-05-30 21:34:53] [INFO ] Computing symmetric may disable matrix : 449 transitions.
[2025-05-30 21:34:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:34:53] [INFO ] Computing symmetric may enable matrix : 449 transitions.
[2025-05-30 21:34:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:34:53] [INFO ] Computing Do-Not-Accords matrix : 449 transitions.
[2025-05-30 21:34:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:34:53] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13751577942451201728
Running compilation step : cd /tmp/ltsmin13751577942451201728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 994 ms.
Running link step : cd /tmp/ltsmin13751577942451201728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13751577942451201728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4926555283348528317.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 449/449 transitions.
Applied a total of 0 rules in 18 ms. Remains 518 /518 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2025-05-30 21:35:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:35:09] [INFO ] Implicit Places using invariants in 853 ms returned []
[2025-05-30 21:35:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:35:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-30 21:35:11] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:35:11] [INFO ] Redundant transitions in 6 ms returned []
Running 295 sub problems to find dead transitions.
[2025-05-30 21:35:11] [INFO ] Invariant cache hit.
[2025-05-30 21:35:11] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 2/518 variables, 26/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:35:18] [INFO ] Deduced a trap composed of 210 places in 124 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:35:18] [INFO ] Deduced a trap composed of 211 places in 119 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:35:20] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:35:20] [INFO ] Deduced a trap composed of 157 places in 161 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:35:20] [INFO ] Deduced a trap composed of 172 places in 151 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:35:20] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:35:22] [INFO ] Deduced a trap composed of 255 places in 181 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 448/966 variables, 518/637 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/966 variables, 28/665 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/967 variables, and 665 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 2/518 variables, 26/112 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 448/966 variables, 518/637 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/966 variables, 28/665 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/966 variables, 295/960 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/967 variables, and 960 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, State Equation: 518/518 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62608 ms. Remains : 518/518 places, 449/449 transitions.
Built C files in :
/tmp/ltsmin16240777017085360890
[2025-05-30 21:36:11] [INFO ] Computing symmetric may disable matrix : 449 transitions.
[2025-05-30 21:36:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:36:11] [INFO ] Computing symmetric may enable matrix : 449 transitions.
[2025-05-30 21:36:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:36:11] [INFO ] Computing Do-Not-Accords matrix : 449 transitions.
[2025-05-30 21:36:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 21:36:11] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16240777017085360890
Running compilation step : cd /tmp/ltsmin16240777017085360890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1010 ms.
Running link step : cd /tmp/ltsmin16240777017085360890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16240777017085360890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7887907352389456213.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 21:36:26] [INFO ] Flatten gal took : 14 ms
[2025-05-30 21:36:26] [INFO ] Flatten gal took : 13 ms
[2025-05-30 21:36:26] [INFO ] Time to serialize gal into /tmp/LTL10447122974166596135.gal : 2 ms
[2025-05-30 21:36:26] [INFO ] Time to serialize properties into /tmp/LTL2105009684570320033.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10447122974166596135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1607660560388681981.hoa' '-atoms' '/tmp/LTL2105009684570320033.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2105009684570320033.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1607660560388681981.hoa
Detected timeout of ITS tools.
[2025-05-30 21:36:41] [INFO ] Flatten gal took : 12 ms
[2025-05-30 21:36:41] [INFO ] Flatten gal took : 11 ms
[2025-05-30 21:36:41] [INFO ] Time to serialize gal into /tmp/LTL3105055050542532522.gal : 2 ms
[2025-05-30 21:36:41] [INFO ] Time to serialize properties into /tmp/LTL17086960372062632124.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3105055050542532522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17086960372062632124.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p1109==0)||(p183==1))"))))
Formula 0 simplified : FG!"((p1109==0)||(p183==1))"
Detected timeout of ITS tools.
[2025-05-30 21:36:56] [INFO ] Flatten gal took : 9 ms
[2025-05-30 21:36:56] [INFO ] Applying decomposition
[2025-05-30 21:36:56] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph440256158108754183.txt' '-o' '/tmp/graph440256158108754183.bin' '-w' '/tmp/graph440256158108754183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph440256158108754183.bin' '-l' '-1' '-v' '-w' '/tmp/graph440256158108754183.weights' '-q' '0' '-e' '0.001'
[2025-05-30 21:36:56] [INFO ] Decomposing Gal with order
[2025-05-30 21:36:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 21:36:56] [INFO ] Removed a total of 7 redundant transitions.
[2025-05-30 21:36:56] [INFO ] Flatten gal took : 24 ms
[2025-05-30 21:36:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-05-30 21:36:56] [INFO ] Time to serialize gal into /tmp/LTL3092073965396235956.gal : 6 ms
[2025-05-30 21:36:56] [INFO ] Time to serialize properties into /tmp/LTL12526412493231392859.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3092073965396235956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12526412493231392859.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i11.u72.p1109==0)||(i8.i1.i0.u0.p183==1))"))))
Formula 0 simplified : FG!"((i11.u72.p1109==0)||(i8.i1.i0.u0.p183==1))"
Reverse transition relation is NOT exact ! Due to transitions t27, t373, t382_t635, t529_t635, i8.i1.i0.t374, i11.t1, Intersection with reachable at each ...217
Computing Next relation with stutter on 7.80653e+13 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
68 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.737967,50876,1,0,51324,53058,6124,75767,1876,181785,74478
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-48b-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-48b-LTLCardinality-13 finished in 201442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3148/3148 places, 3062/3062 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3137 transition count 3051
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3137 transition count 3051
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 3132 transition count 3046
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 3132 transition count 3046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3131 transition count 3045
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3131 transition count 3045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3130 transition count 3044
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3130 transition count 3044
Applied a total of 36 rules in 1559 ms. Remains 3130 /3148 variables (removed 18) and now considering 3044/3062 (removed 18) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2025-05-30 21:36:59] [INFO ] Computed 258 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:37:01] [INFO ] Implicit Places using invariants in 1815 ms returned []
[2025-05-30 21:37:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:37:07] [INFO ] Implicit Places using invariants and state equation in 6372 ms returned []
Implicit Place search using SMT with State Equation took 8192 ms to find 0 implicit places.
Running 3043 sub problems to find dead transitions.
[2025-05-30 21:37:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3129/6174 variables, and 0 constraints, problems are : Problem set: 0 solved, 3043 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3130 constraints, PredecessorRefiner: 3043/3043 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3043 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3129/6174 variables, and 0 constraints, problems are : Problem set: 0 solved, 3043 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/257 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3130 constraints, PredecessorRefiner: 0/3043 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60994ms problems are : Problem set: 0 solved, 3043 unsolved
Search for dead transitions found 0 dead transitions in 60999ms
Starting structural reductions in LTL mode, iteration 1 : 3130/3148 places, 3044/3062 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70763 ms. Remains : 3130/3148 places, 3044/3062 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 667 ms.
Product exploration explored 100000 steps with 50000 reset in 681 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLCardinality-15 finished in 72340 ms.
All properties solved by simple procedures.
Total runtime 846425 ms.

BK_STOP 1748641090036

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-48b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729600579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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