Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729500547.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-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729500547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 266K 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-12b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748630709374

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-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 18:45:10] [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 18:45:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 18:45:10] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-05-30 18:45:10] [INFO ] Transformed 1126 places.
[2025-05-30 18:45:10] [INFO ] Transformed 1124 transitions.
[2025-05-30 18:45:10] [INFO ] Found NUPN structural information;
[2025-05-30 18:45:10] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-12b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 156 place count 970 transition count 968
Iterating global reduction 0 with 156 rules applied. Total rules applied 312 place count 970 transition count 968
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 336 place count 970 transition count 944
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 403 place count 903 transition count 877
Iterating global reduction 1 with 67 rules applied. Total rules applied 470 place count 903 transition count 877
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 482 place count 891 transition count 865
Iterating global reduction 1 with 12 rules applied. Total rules applied 494 place count 891 transition count 865
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 505 place count 880 transition count 854
Iterating global reduction 1 with 11 rules applied. Total rules applied 516 place count 880 transition count 854
Applied a total of 516 rules in 429 ms. Remains 880 /1126 variables (removed 246) and now considering 854/1124 (removed 270) transitions.
// Phase 1: matrix 854 rows 880 cols
[2025-05-30 18:45:11] [INFO ] Computed 76 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:45:12] [INFO ] Implicit Places using invariants in 676 ms returned []
[2025-05-30 18:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:45:13] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
Running 853 sub problems to find dead transitions.
[2025-05-30 18:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 1 (OVERLAPS) 1/880 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 853 unsolved
SMT process timed out in 30195ms, After SMT, problems are : Problem set: 0 solved, 853 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Starting structural reductions in LTL mode, iteration 1 : 880/1126 places, 854/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32309 ms. Remains : 880/1126 places, 854/1124 transitions.
Support contains 19 out of 880 places after structural reductions.
[2025-05-30 18:45:43] [INFO ] Flatten gal took : 84 ms
[2025-05-30 18:45:43] [INFO ] Flatten gal took : 45 ms
[2025-05-30 18:45:43] [INFO ] Input system was already deterministic with 854 transitions.
RANDOM walk for 40000 steps (72 resets) in 885 ms. (45 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
[2025-05-30 18:45:44] [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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 312/319 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 500/819 variables, 69/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/880 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/880 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 854/1734 variables, 880/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1734 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1734 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 956 constraints, problems are : Problem set: 0 solved, 4 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 880/880 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 312/319 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 500/819 variables, 69/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 61/880 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:45] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:45] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:47] [INFO ] Deduced a trap composed of 65 places in 1088 ms of which 929 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:47] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:47] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:47] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:47] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:48] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/880 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:48] [INFO ] Deduced a trap composed of 144 places in 196 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:48] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:48] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 66 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/880 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/880 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 854/1734 variables, 880/968 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1734 variables, 4/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:49] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:49] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:45:50] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 47 ms to minimize.
SMT process timed out in 5746ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 880/880 places, 854/854 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 880 transition count 543
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 347 rules applied. Total rules applied 658 place count 569 transition count 507
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 683 place count 545 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 684 place count 544 transition count 506
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 684 place count 544 transition count 401
Deduced a syphon composed of 105 places in 3 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 894 place count 439 transition count 401
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 898 place count 435 transition count 397
Iterating global reduction 4 with 4 rules applied. Total rules applied 902 place count 435 transition count 397
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 902 place count 435 transition count 395
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 906 place count 433 transition count 395
Performed 168 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1242 place count 265 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1243 place count 265 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 47 times.
Iterating global reduction 5 with 47 rules applied. Total rules applied 1290 place count 265 transition count 156
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1337 place count 218 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1338 place count 217 transition count 155
Reduce places removed 56 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 6 with 137 rules applied. Total rules applied 1475 place count 161 transition count 74
Reduce places removed 81 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 83 rules applied. Total rules applied 1558 place count 80 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1560 place count 78 transition count 72
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 1560 place count 78 transition count 50
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 1604 place count 56 transition count 50
Applied a total of 1604 rules in 137 ms. Remains 56 /880 variables (removed 824) and now considering 50/854 (removed 804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 56/880 places, 50/854 transitions.
RANDOM walk for 471 steps (21 resets) in 16 ms. (27 steps per ms) remains 0/4 properties
Computed a total of 215 stabilizing places and 215 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' '!(G(F(p0)))'
Support contains 2 out of 880 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 880/880 places, 854/854 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 312 place count 879 transition count 541
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 348 rules applied. Total rules applied 660 place count 567 transition count 505
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 685 place count 543 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 542 transition count 504
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 686 place count 542 transition count 400
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 894 place count 438 transition count 400
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 899 place count 433 transition count 395
Iterating global reduction 4 with 5 rules applied. Total rules applied 904 place count 433 transition count 395
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 904 place count 433 transition count 393
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 908 place count 431 transition count 393
Performed 168 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1244 place count 263 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1245 place count 262 transition count 200
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 34 rules applied. Total rules applied 1279 place count 239 transition count 189
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1290 place count 228 transition count 189
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1290 place count 228 transition count 177
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1314 place count 216 transition count 177
Applied a total of 1314 rules in 98 ms. Remains 216 /880 variables (removed 664) and now considering 177/854 (removed 677) transitions.
// Phase 1: matrix 177 rows 216 cols
[2025-05-30 18:45:50] [INFO ] Computed 53 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:45:50] [INFO ] Implicit Places using invariants in 135 ms returned [181, 185, 189, 193, 197, 202, 206, 210, 215]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 138 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/880 places, 177/854 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 200 transition count 170
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 200 transition count 170
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 193 transition count 163
Applied a total of 28 rules in 13 ms. Remains 193 /207 variables (removed 14) and now considering 163/177 (removed 14) transitions.
// Phase 1: matrix 163 rows 193 cols
[2025-05-30 18:45:50] [INFO ] Computed 44 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:45:50] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-05-30 18:45:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:45:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 18:45:50] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 193/880 places, 163/854 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 615 ms. Remains : 193/880 places, 163/854 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-01
Stuttering criterion allowed to conclude after 67 steps with 1 reset in 4 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-01 finished in 851 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((X(X(X(p0))) U G(p1))))'
Support contains 4 out of 880 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 880/880 places, 854/854 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 875 transition count 849
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 874 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 874 transition count 848
Applied a total of 12 rules in 110 ms. Remains 874 /880 variables (removed 6) and now considering 848/854 (removed 6) transitions.
// Phase 1: matrix 848 rows 874 cols
[2025-05-30 18:45:51] [INFO ] Computed 76 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:45:51] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-05-30 18:45:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:45:52] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2025-05-30 18:45:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/1722 variables, and 76 constraints, problems are : Problem set: 0 solved, 847 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/874 constraints, PredecessorRefiner: 847/847 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:43] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:44] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:44] [INFO ] Deduced a trap composed of 80 places in 299 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:44] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:45] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:45] [INFO ] Deduced a trap composed of 81 places in 297 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:45] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:45] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:46] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:46] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:46] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:46] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:47] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:47] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:47] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:47] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:47] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:48] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:48] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:48] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/874 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:49] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:50] [INFO ] Deduced a trap composed of 85 places in 267 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:50] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:50] [INFO ] Deduced a trap composed of 87 places in 265 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:51] [INFO ] Deduced a trap composed of 87 places in 254 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:51] [INFO ] Deduced a trap composed of 87 places in 253 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:51] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:51] [INFO ] Deduced a trap composed of 123 places in 209 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:52] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:52] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 21 ms to minimize.
SMT process timed out in 60180ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 874/880 places, 848/854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61469 ms. Remains : 874/880 places, 848/854 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-02
Product exploration explored 100000 steps with 16632 reset in 254 ms.
Product exploration explored 100000 steps with 16658 reset in 211 ms.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (72 resets) in 449 ms. (88 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
[2025-05-30 18:46:54] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 310/314 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/811 variables, 68/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 848/1722 variables, 874/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1722 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1722 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1722/1722 variables, and 950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 874/874 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 310/314 variables, 7/7 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 18:46:54] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 497/811 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/874 variables, 1/77 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 18:46:54] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:55] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:55] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:55] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:55] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:55] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:46:56] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 848/1722 variables, 874/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1722 variables, 1/959 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 18:46:56] [INFO ] Deduced a trap along path composed of 53 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1722 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1722 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1722 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 960 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2287 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 874/874 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2709ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 213 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 390 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Applied a total of 0 rules in 29 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
[2025-05-30 18:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:46:58] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-05-30 18:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:46:59] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2025-05-30 18:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
SMT process timed out in 30095ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30097ms
Finished structural reductions in LTL mode , in 1 iterations and 31259 ms. Remains : 874/874 places, 848/848 transitions.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (71 resets) in 188 ms. (211 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2025-05-30 18:47:29] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 310/314 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/811 variables, 68/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 848/1722 variables, 874/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1722 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1722 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1722/1722 variables, and 950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 874/874 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 310/314 variables, 7/7 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 18:47:30] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 497/811 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/874 variables, 1/77 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 18:47:30] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:30] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:30] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:31] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:31] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:31] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:31] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 848/1722 variables, 874/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1722 variables, 1/959 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 18:47:31] [INFO ] Deduced a trap along path composed of 53 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1722 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1722 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1722 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 960 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2173 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 874/874 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2614ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 211 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=211 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 16739 reset in 145 ms.
Product exploration explored 100000 steps with 16652 reset in 152 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Performed 277 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 874 transition count 848
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 301 place count 874 transition count 836
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 301 place count 874 transition count 838
Deduced a syphon composed of 404 places in 1 ms
Iterating global reduction 2 with 115 rules applied. Total rules applied 416 place count 874 transition count 838
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 655 place count 635 transition count 599
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 894 place count 635 transition count 599
Performed 204 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 369 places in 1 ms
Iterating global reduction 2 with 204 rules applied. Total rules applied 1098 place count 635 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1099 place count 635 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 1229 place count 505 transition count 446
Deduced a syphon composed of 239 places in 0 ms
Iterating global reduction 3 with 130 rules applied. Total rules applied 1359 place count 505 transition count 446
Deduced a syphon composed of 239 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1360 place count 505 transition count 445
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 240 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1361 place count 505 transition count 445
Deduced a syphon composed of 240 places in 0 ms
Applied a total of 1361 rules in 223 ms. Remains 505 /874 variables (removed 369) and now considering 445/848 (removed 403) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:47:34] [INFO ] Redundant transitions in 46 ms returned []
Running 444 sub problems to find dead transitions.
// Phase 1: matrix 445 rows 505 cols
[2025-05-30 18:47:34] [INFO ] Computed 76 invariants in 18 ms
[2025-05-30 18:47:34] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:48] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:48] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:48] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:48] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:48] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:48] [INFO ] Deduced a trap composed of 2 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 2 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:49] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/96 constraints. Problems are: Problem set: 94 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 5 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/116 constraints. Problems are: Problem set: 135 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:52] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:52] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:52] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:52] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/136 constraints. Problems are: Problem set: 189 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:47:55] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD442 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 15/151 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/151 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 445/950 variables, 505/656 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/950 variables, 82/738 constraints. Problems are: Problem set: 242 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 950/950 variables, and 738 constraints, problems are : Problem set: 242 solved, 202 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 505/505 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 242 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 237/501 variables, 74/74 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 75/149 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/149 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 4/505 variables, 2/151 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/151 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 445/950 variables, 505/656 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 82/738 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/950 variables, 202/940 constraints. Problems are: Problem set: 242 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/950 variables, and 940 constraints, problems are : Problem set: 242 solved, 202 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 505/505 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 202/444 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 242 solved, 202 unsolved
Search for dead transitions found 242 dead transitions in 60328ms
Found 242 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 242 transitions
Dead transitions reduction (with SMT) removed 242 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 505/874 places, 203/848 transitions.
Graph (complete) has 683 edges and 505 vertex of which 265 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.2 ms
Discarding 240 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 265 /505 variables (removed 240) and now considering 203/203 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 265/874 places, 203/848 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60643 ms. Remains : 265/874 places, 203/848 transitions.
Built C files in :
/tmp/ltsmin2154645937312657770
[2025-05-30 18:48:35] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2154645937312657770
Running compilation step : cd /tmp/ltsmin2154645937312657770;'/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 1430 ms.
Running link step : cd /tmp/ltsmin2154645937312657770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2154645937312657770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3386258752395496385.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Applied a total of 0 rules in 34 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
// Phase 1: matrix 848 rows 874 cols
[2025-05-30 18:48:50] [INFO ] Computed 76 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:48:50] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-05-30 18:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:48:51] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2025-05-30 18:48:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:49:21] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 35 ms to minimize.
SMT process timed out in 30158ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30160ms
Finished structural reductions in LTL mode , in 1 iterations and 31402 ms. Remains : 874/874 places, 848/848 transitions.
Built C files in :
/tmp/ltsmin3344734578659324493
[2025-05-30 18:49:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3344734578659324493
Running compilation step : cd /tmp/ltsmin3344734578659324493;'/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 1275 ms.
Running link step : cd /tmp/ltsmin3344734578659324493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3344734578659324493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7541913773330236895.hoa' '--buchi-type=spotba'
LTSmin run took 1569 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12b-LTLCardinality-02 finished in 213359 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' '!(F(G(p0)))'
Support contains 2 out of 880 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 880/880 places, 854/854 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 879 transition count 540
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 349 rules applied. Total rules applied 662 place count 566 transition count 504
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 686 place count 542 transition count 504
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 686 place count 542 transition count 400
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 894 place count 438 transition count 400
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 897 place count 435 transition count 397
Iterating global reduction 3 with 3 rules applied. Total rules applied 900 place count 435 transition count 397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 900 place count 435 transition count 396
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 902 place count 434 transition count 396
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 1242 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1243 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 34 rules applied. Total rules applied 1277 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1288 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1288 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1312 place count 217 transition count 178
Applied a total of 1312 rules in 56 ms. Remains 217 /880 variables (removed 663) and now considering 178/854 (removed 676) transitions.
// Phase 1: matrix 178 rows 217 cols
[2025-05-30 18:49:24] [INFO ] Computed 53 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:49:24] [INFO ] Implicit Places using invariants in 127 ms returned [90, 128, 166, 170, 174, 178, 182, 186, 190, 194, 198, 203, 207, 211, 216]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 129 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/880 places, 178/854 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 189 transition count 165
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 189 transition count 165
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 28 place count 188 transition count 164
Applied a total of 28 rules in 8 ms. Remains 188 /202 variables (removed 14) and now considering 164/178 (removed 14) transitions.
// Phase 1: matrix 164 rows 188 cols
[2025-05-30 18:49:24] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:49:24] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-30 18:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:49:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-30 18:49:25] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 188/880 places, 164/854 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1142 ms. Remains : 188/880 places, 164/854 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-05
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-05 finished in 1206 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(X(X(X(p0)))))'
Support contains 2 out of 880 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 880/880 places, 854/854 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 875 transition count 849
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 875 transition count 849
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 873 transition count 847
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 873 transition count 847
Applied a total of 14 rules in 81 ms. Remains 873 /880 variables (removed 7) and now considering 847/854 (removed 7) transitions.
// Phase 1: matrix 847 rows 873 cols
[2025-05-30 18:49:25] [INFO ] Computed 76 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:49:26] [INFO ] Implicit Places using invariants in 383 ms returned []
[2025-05-30 18:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:49:27] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2025-05-30 18:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:49:56] [INFO ] Deduced a trap composed of 35 places in 284 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:49:56] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:49:56] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:49:57] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 26 ms to minimize.
SMT process timed out in 30218ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Starting structural reductions in LTL mode, iteration 1 : 873/880 places, 847/854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31477 ms. Remains : 873/880 places, 847/854 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 31711 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((G(p0) U X((p1 U X(X(X(!p1))))))))'
Support contains 3 out of 880 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 880/880 places, 854/854 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 875 transition count 849
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 875 transition count 849
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 873 transition count 847
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 873 transition count 847
Applied a total of 14 rules in 93 ms. Remains 873 /880 variables (removed 7) and now considering 847/854 (removed 7) transitions.
// Phase 1: matrix 847 rows 873 cols
[2025-05-30 18:49:57] [INFO ] Computed 76 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:49:57] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-05-30 18:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:49:58] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2025-05-30 18:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:28] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 873/1720 variables, and 77 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:40] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:41] [INFO ] Deduced a trap composed of 80 places in 309 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:41] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:41] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:41] [INFO ] Deduced a trap composed of 81 places in 280 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:42] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:42] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:42] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:42] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:43] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:43] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:43] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:43] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:43] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:44] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:44] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:44] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:44] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:44] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:45] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/873 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:46] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:46] [INFO ] Deduced a trap composed of 85 places in 273 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:47] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:47] [INFO ] Deduced a trap composed of 87 places in 269 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:47] [INFO ] Deduced a trap composed of 87 places in 287 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:48] [INFO ] Deduced a trap composed of 123 places in 212 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:48] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:48] [INFO ] Deduced a trap composed of 123 places in 208 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:49] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:49] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:49] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:49] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:50] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:50] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:50] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:50] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:51] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:51] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:52] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:52] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/873 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:54] [INFO ] Deduced a trap composed of 89 places in 254 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:54] [INFO ] Deduced a trap composed of 91 places in 251 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:54] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:55] [INFO ] Deduced a trap composed of 91 places in 250 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:55] [INFO ] Deduced a trap composed of 93 places in 258 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:55] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:56] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:56] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:56] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:57] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:57] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:57] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:57] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:57] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:50:58] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 21 ms to minimize.
SMT process timed out in 60146ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 873/880 places, 847/854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61359 ms. Remains : 873/880 places, 847/854 transitions.
Stuttering acceptance computed with spot in 616 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-10
Product exploration explored 100000 steps with 17424 reset in 147 ms.
Product exploration explored 100000 steps with 17411 reset in 171 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Detected a total of 211/873 stabilizing places and 211/847 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 216 ms. Reduced automaton from 20 states, 36 edges and 2 AP (stutter sensitive) to 20 states, 36 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 750 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (72 resets) in 293 ms. (136 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
[2025-05-30 18:51:00] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 245/248 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 562/810 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 3 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 245/248 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 562/810 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:01] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:02] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:02] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 63/873 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:02] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:02] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:03] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:03] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:03] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/873 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 847/1720 variables, 873/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 3/960 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1720 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 960 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2860 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3433ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 225 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=45 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 495 ms. Reduced automaton from 20 states, 36 edges and 2 AP (stutter sensitive) to 20 states, 36 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 766 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 768 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 30 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2025-05-30 18:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:51:06] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-05-30 18:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:51:07] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2025-05-30 18:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:37] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:37] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:37] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 19 ms to minimize.
SMT process timed out in 30106ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30108ms
Finished structural reductions in LTL mode , in 1 iterations and 31298 ms. Remains : 873/873 places, 847/847 transitions.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Detected a total of 211/873 stabilizing places and 211/847 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 20 states, 36 edges and 2 AP (stutter sensitive) to 20 states, 36 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 833 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (71 resets) in 239 ms. (166 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2025-05-30 18:51:38] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 245/248 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 562/810 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 245/248 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 562/810 variables, 60/75 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 18:51:39] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:39] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:39] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/873 variables, 1/79 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 18:51:40] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:40] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:40] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:40] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:40] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:40] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/873 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 847/1720 variables, 873/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1720 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 959 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2320ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 206 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=103 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 503 ms. Reduced automaton from 20 states, 36 edges and 2 AP (stutter sensitive) to 20 states, 36 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 784 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 776 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 781 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 17434 reset in 197 ms.
Product exploration explored 100000 steps with 17429 reset in 201 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, false, false, false, false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 731 ms :[p1, p1, p1, p1, p1, p1, p1, true, (AND p1 (NOT p0)), p1, p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 302 place count 873 transition count 835
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 302 place count 873 transition count 835
Deduced a syphon composed of 404 places in 1 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 416 place count 873 transition count 835
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 655 place count 634 transition count 596
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 894 place count 634 transition count 596
Performed 206 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 371 places in 0 ms
Iterating global reduction 2 with 206 rules applied. Total rules applied 1100 place count 634 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1101 place count 634 transition count 572
Renaming transitions due to excessive name length > 1024 char.
Discarding 134 places :
Symmetric choice reduction at 3 with 134 rule applications. Total rules 1235 place count 500 transition count 438
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 3 with 134 rules applied. Total rules applied 1369 place count 500 transition count 438
Deduced a syphon composed of 237 places in 0 ms
Applied a total of 1369 rules in 95 ms. Remains 500 /873 variables (removed 373) and now considering 438/847 (removed 409) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:51:45] [INFO ] Redundant transitions in 7 ms returned []
Running 437 sub problems to find dead transitions.
// Phase 1: matrix 438 rows 500 cols
[2025-05-30 18:51:45] [INFO ] Computed 76 invariants in 3 ms
[2025-05-30 18:51:45] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:58] [INFO ] Deduced a trap composed of 2 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:58] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:58] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 6 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:51:59] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 6 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 6 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 6 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 6 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 6 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 6 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 6 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 6 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 6 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:00] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/96 constraints. Problems are: Problem set: 73 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 5 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 6 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 6 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 6 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 5 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:01] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 6 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 6 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 6 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 6 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 6 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 6 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 6 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:02] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 13 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 20/116 constraints. Problems are: Problem set: 117 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 5 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 4 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 4 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 4 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:04] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 20/136 constraints. Problems are: Problem set: 186 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:08] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:08] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD188 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:08] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 7 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD233 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:08] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:52:09] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 8 ms to minimize.
Problem TDEAD248 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 18/154 constraints. Problems are: Problem set: 237 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/154 constraints. Problems are: Problem set: 237 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 438/938 variables, 500/654 constraints. Problems are: Problem set: 237 solved, 200 unsolved
SMT process timed out in 30106ms, After SMT, problems are : Problem set: 237 solved, 200 unsolved
Search for dead transitions found 237 dead transitions in 30108ms
Found 237 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 237 transitions
Dead transitions reduction (with SMT) removed 237 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 500/873 places, 201/847 transitions.
Graph (complete) has 681 edges and 500 vertex of which 263 are kept as prefixes of interest. Removing 237 places using SCC suffix rule.1 ms
Discarding 237 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 263 /500 variables (removed 237) and now considering 201/201 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 263/873 places, 201/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30230 ms. Remains : 263/873 places, 201/847 transitions.
Built C files in :
/tmp/ltsmin6947751120723344130
[2025-05-30 18:52:15] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6947751120723344130
Running compilation step : cd /tmp/ltsmin6947751120723344130;'/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 1254 ms.
Running link step : cd /tmp/ltsmin6947751120723344130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6947751120723344130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6016518524742701700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 33 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
// Phase 1: matrix 847 rows 873 cols
[2025-05-30 18:52:30] [INFO ] Computed 76 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:52:31] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-05-30 18:52:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:52:32] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2025-05-30 18:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:53:01] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:53:01] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:53:01] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:53:02] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 32 ms to minimize.
SMT process timed out in 30083ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30085ms
Finished structural reductions in LTL mode , in 1 iterations and 31297 ms. Remains : 873/873 places, 847/847 transitions.
Built C files in :
/tmp/ltsmin14119974150199518641
[2025-05-30 18:53:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14119974150199518641
Running compilation step : cd /tmp/ltsmin14119974150199518641;'/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 1270 ms.
Running link step : cd /tmp/ltsmin14119974150199518641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14119974150199518641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15205948281670909105.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:53:17] [INFO ] Flatten gal took : 31 ms
[2025-05-30 18:53:17] [INFO ] Flatten gal took : 29 ms
[2025-05-30 18:53:17] [INFO ] Time to serialize gal into /tmp/LTL7638866899920960918.gal : 8 ms
[2025-05-30 18:53:17] [INFO ] Time to serialize properties into /tmp/LTL1031566526533113668.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/LTL7638866899920960918.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14774656443537829138.hoa' '-atoms' '/tmp/LTL1031566526533113668.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/LTL1031566526533113668.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14774656443537829138.hoa
Detected timeout of ITS tools.
[2025-05-30 18:53:32] [INFO ] Flatten gal took : 28 ms
[2025-05-30 18:53:32] [INFO ] Flatten gal took : 28 ms
[2025-05-30 18:53:32] [INFO ] Time to serialize gal into /tmp/LTL8163471908094431225.gal : 5 ms
[2025-05-30 18:53:32] [INFO ] Time to serialize properties into /tmp/LTL6211143368727401805.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8163471908094431225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6211143368727401805.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...275
Read 1 LTL properties
Checking formula 0 : !((G((G("((p335==0)||(p50==1))"))U(X(("(p903==1)")U(X(X(X("(p903!=1)")))))))))
Formula 0 simplified : F(F!"((p335==0)||(p50==1))" R X(!"(p903==1)" R XXX!"(p903!=1)"))
Detected timeout of ITS tools.
[2025-05-30 18:53:47] [INFO ] Flatten gal took : 25 ms
[2025-05-30 18:53:47] [INFO ] Applying decomposition
[2025-05-30 18:53:47] [INFO ] Flatten gal took : 24 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/graph8803741485145441965.txt' '-o' '/tmp/graph8803741485145441965.bin' '-w' '/tmp/graph8803741485145441965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8803741485145441965.bin' '-l' '-1' '-v' '-w' '/tmp/graph8803741485145441965.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:53:47] [INFO ] Decomposing Gal with order
[2025-05-30 18:53:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:53:47] [INFO ] Removed a total of 168 redundant transitions.
[2025-05-30 18:53:48] [INFO ] Flatten gal took : 137 ms
[2025-05-30 18:53:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-05-30 18:53:48] [INFO ] Time to serialize gal into /tmp/LTL7603294007860804304.gal : 13 ms
[2025-05-30 18:53:48] [INFO ] Time to serialize properties into /tmp/LTL1444345806925099869.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/LTL7603294007860804304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1444345806925099869.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...254
Read 1 LTL properties
Checking formula 0 : !((G((G("((i2.u99.p335==0)||(i4.u23.p50==1))"))U(X(("(i1.u285.p903==1)")U(X(X(X("(i1.u285.p903!=1)")))))))))
Formula 0 simplified : F(F!"((i2.u99.p335==0)||(i4.u23.p50==1))" R X(!"(i1.u285.p903==1)" R XXX!"(i1.u285.p903!=1)"))
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-12b-LTLCardinality-10 finished in 245689 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(X(G(F((!(p0 U p1)||X(p2))))))||G(X(p0))))'
Support contains 6 out of 880 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 880/880 places, 854/854 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 875 transition count 849
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 875 transition count 849
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 873 transition count 847
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 873 transition count 847
Applied a total of 14 rules in 89 ms. Remains 873 /880 variables (removed 7) and now considering 847/854 (removed 7) transitions.
// Phase 1: matrix 847 rows 873 cols
[2025-05-30 18:54:03] [INFO ] Computed 76 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:54:03] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-05-30 18:54:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:54:04] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2025-05-30 18:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 873/1720 variables, and 76 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:54] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:54] [INFO ] Deduced a trap composed of 80 places in 290 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:55] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:55] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:55] [INFO ] Deduced a trap composed of 81 places in 295 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:56] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:56] [INFO ] Deduced a trap composed of 85 places in 272 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:56] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:56] [INFO ] Deduced a trap composed of 87 places in 281 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:57] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:57] [INFO ] Deduced a trap composed of 87 places in 282 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:57] [INFO ] Deduced a trap composed of 87 places in 280 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:58] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:58] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:58] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:58] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:59] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:59] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:59] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:54:59] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:01] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:01] [INFO ] Deduced a trap composed of 89 places in 261 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:01] [INFO ] Deduced a trap composed of 90 places in 267 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:02] [INFO ] Deduced a trap composed of 91 places in 268 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:02] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:02] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:02] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:03] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:03] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:03] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:03] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:03] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:04] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:04] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:04] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 15 ms to minimize.
SMT process timed out in 60182ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 873/880 places, 847/854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61404 ms. Remains : 873/880 places, 847/854 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-15
Product exploration explored 100000 steps with 182 reset in 294 ms.
Product exploration explored 100000 steps with 182 reset in 259 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 148 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (72 resets) in 138 ms. (287 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2025-05-30 18:55:05] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 539/812 variables, 70/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/812 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 61/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 2 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:06] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 539/812 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:06] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:06] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/812 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 61/873 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:06] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:07] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:07] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:07] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:07] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:07] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:08] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:55:08] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 847/1720 variables, 873/960 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 2/962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1720 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1720 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 962 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2906 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3403ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 342 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 383 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 872 transition count 539
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 343 rules applied. Total rules applied 650 place count 565 transition count 503
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 676 place count 541 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 539 transition count 501
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 678 place count 539 transition count 397
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 886 place count 435 transition count 397
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1228 place count 264 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1229 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1230 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 34 rules applied. Total rules applied 1264 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1275 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1275 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1299 place count 217 transition count 178
Applied a total of 1299 rules in 58 ms. Remains 217 /873 variables (removed 656) and now considering 178/847 (removed 669) transitions.
// Phase 1: matrix 178 rows 217 cols
[2025-05-30 18:55:09] [INFO ] Computed 53 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:55:10] [INFO ] Implicit Places using invariants in 137 ms returned [88, 126, 164, 174, 178, 182, 186, 190, 194, 198, 203, 207, 211, 216]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 139 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/873 places, 178/847 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 191 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 177 transition count 152
Applied a total of 52 rules in 30 ms. Remains 177 /203 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 177 cols
[2025-05-30 18:55:10] [INFO ] Computed 39 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:55:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 18:55:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:55:10] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/873 places, 152/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 514 ms. Remains : 177/873 places, 152/847 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 9 factoid took 384 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 16136 steps (351 resets) in 72 ms. (221 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 9 factoid took 574 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering criterion allowed to conclude after 24758 steps with 536 reset in 62 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-15 finished in 68788 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((G(p0) U X((p1 U X(X(X(!p1))))))))'
[2025-05-30 18:55:12] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2364690723412171951
[2025-05-30 18:55:12] [INFO ] Computing symmetric may disable matrix : 854 transitions.
[2025-05-30 18:55:12] [INFO ] Applying decomposition
[2025-05-30 18:55:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:55:12] [INFO ] Computing symmetric may enable matrix : 854 transitions.
[2025-05-30 18:55:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:55:12] [INFO ] Flatten gal took : 20 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/graph11290777269014024663.txt' '-o' '/tmp/graph11290777269014024663.bin' '-w' '/tmp/graph11290777269014024663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11290777269014024663.bin' '-l' '-1' '-v' '-w' '/tmp/graph11290777269014024663.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:55:12] [INFO ] Decomposing Gal with order
[2025-05-30 18:55:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:55:12] [INFO ] Removed a total of 165 redundant transitions.
[2025-05-30 18:55:12] [INFO ] Flatten gal took : 40 ms
[2025-05-30 18:55:12] [INFO ] Computing Do-Not-Accords matrix : 854 transitions.
[2025-05-30 18:55:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-05-30 18:55:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality6188255804829405240.gal : 7 ms
[2025-05-30 18:55:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality154805775325084423.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/LTLCardinality6188255804829405240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality154805775325084423.ltl' '-c' '-stutter-deadlock'
[2025-05-30 18:55:12] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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...275
Read 1 LTL properties
[2025-05-30 18:55:12] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2364690723412171951
Running compilation step : cd /tmp/ltsmin2364690723412171951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((G((G("((i11.u99.p335==0)||(i6.u23.p50==1))"))U(X(("(i15.u279.p903==1)")U(X(X(X("(i15.u279.p903!=1)")))))))))
Formula 0 simplified : F(F!"((i11.u99.p335==0)||(i6.u23.p50==1))" R X(!"(i15.u279.p903==1)" R XXX!"(i15.u279.p903!=1)"))
Compilation finished in 2252 ms.
Running link step : cd /tmp/ltsmin2364690723412171951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2364690723412171951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp0==true)) U X(((LTLAPp1==true) U X(X(X(!(LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.070: LTL layer: formula: [](([]((LTLAPp0==true)) U X(((LTLAPp1==true) U X(X(X(!(LTLAPp1==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.071: "[](([]((LTLAPp0==true)) U X(((LTLAPp1==true) U X(X(X(!(LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.073: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.120: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.323: DFS-FIFO for weak LTL, using special progress label 857
pins2lts-mc-linux64( 0/ 8), 0.323: There are 858 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.323: State length is 881, there are 890 groups
pins2lts-mc-linux64( 0/ 8), 0.323: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.323: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.323: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.323: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.402: ~2 levels ~960 states ~2864 transitions
pins2lts-mc-linux64( 7/ 8), 0.450: ~2 levels ~1920 states ~6080 transitions
pins2lts-mc-linux64( 0/ 8), 0.565: ~2 levels ~3840 states ~14200 transitions
pins2lts-mc-linux64( 0/ 8), 0.774: ~2 levels ~7680 states ~34816 transitions
pins2lts-mc-linux64( 0/ 8), 1.170: ~2 levels ~15360 states ~83928 transitions
pins2lts-mc-linux64( 5/ 8), 1.907: ~2 levels ~30720 states ~153544 transitions
pins2lts-mc-linux64( 5/ 8), 3.353: ~2 levels ~61440 states ~330152 transitions
pins2lts-mc-linux64( 5/ 8), 5.906: ~2 levels ~122880 states ~716976 transitions
pins2lts-mc-linux64( 7/ 8), 11.076: ~2 levels ~245760 states ~1596440 transitions
pins2lts-mc-linux64( 5/ 8), 20.987: ~2 levels ~491520 states ~3308384 transitions
pins2lts-mc-linux64( 7/ 8), 40.426: ~2 levels ~983040 states ~7207680 transitions
pins2lts-mc-linux64( 5/ 8), 79.655: ~2 levels ~1966080 states ~14853328 transitions
pins2lts-mc-linux64( 5/ 8), 160.800: ~2 levels ~3932160 states ~32407496 transitions
pins2lts-mc-linux64( 5/ 8), 322.530: ~2 levels ~7864320 states ~66778544 transitions
pins2lts-mc-linux64( 5/ 8), 660.249: ~2 levels ~15728640 states ~143689016 transitions
pins2lts-mc-linux64( 5/ 8), 1328.332: ~2 levels ~31457280 states ~295744424 transitions
pins2lts-mc-linux64( 7/ 8), 1376.341: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1376.384:
pins2lts-mc-linux64( 0/ 8), 1376.384: mean standard work distribution: 3.7% (states) 4.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1376.384:
pins2lts-mc-linux64( 0/ 8), 1376.384: Explored 30817889 states 315048735 transitions, fanout: 10.223
pins2lts-mc-linux64( 0/ 8), 1376.384: Total exploration time 1376.040 sec (1376.020 sec minimum, 1376.026 sec on average)
pins2lts-mc-linux64( 0/ 8), 1376.384: States per second: 22396, Transitions per second: 228953
pins2lts-mc-linux64( 0/ 8), 1376.384:
pins2lts-mc-linux64( 0/ 8), 1376.384: Progress states detected: 51516607
pins2lts-mc-linux64( 0/ 8), 1376.384: Redundant explorations: -46.8258
pins2lts-mc-linux64( 0/ 8), 1376.384:
pins2lts-mc-linux64( 0/ 8), 1376.384: Queue width: 8B, total height: 46381482, memory: 353.86MB
pins2lts-mc-linux64( 0/ 8), 1376.384: Tree memory: 698.2MB, 12.6 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1376.384: Tree fill ratio (roots/leafs): 43.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1376.386: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1376.407: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1376.407: Est. total memory use: 1052.0MB (~1377.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2364690723412171951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp0==true)) U X(((LTLAPp1==true) U X(X(X(!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2364690723412171951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp0==true)) U X(((LTLAPp1==true) U X(X(X(!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 19:18:33] [INFO ] Applying decomposition
[2025-05-30 19:18:34] [INFO ] Flatten gal took : 261 ms
[2025-05-30 19:18:34] [INFO ] Decomposing Gal with order
[2025-05-30 19:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 19:18:34] [INFO ] Removed a total of 26 redundant transitions.
[2025-05-30 19:18:34] [INFO ] Flatten gal took : 148 ms
[2025-05-30 19:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 1515 ms.
[2025-05-30 19:18:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality1151887292412213162.gal : 78 ms
[2025-05-30 19:18:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality10299042679327644555.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1151887292412213162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10299042679327644555.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...277
Read 1 LTL properties
Checking formula 0 : !((G((G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u81.p3...463
Formula 0 simplified : F(F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u81.p335...451
Detected timeout of ITS tools.
[2025-05-30 19:41:59] [INFO ] Flatten gal took : 243 ms
[2025-05-30 19:42:00] [INFO ] Input system was already deterministic with 854 transitions.
[2025-05-30 19:42:00] [INFO ] Transformed 880 places.
[2025-05-30 19:42:00] [INFO ] Transformed 854 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 19:42:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality11704206568491743342.gal : 15 ms
[2025-05-30 19:42:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality4997669564403565087.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11704206568491743342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4997669564403565087.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G("((p335==0)||(p50==1))"))U(X(("(p903==1)")U(X(X(X("(p903!=1)")))))))))
Formula 0 simplified : F(F!"((p335==0)||(p50==1))" R X(!"(p903==1)" R XXX!"(p903!=1)"))

BK_TIME_CONFINEMENT_REACHED

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

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