Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593200508.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutoFlight-PT-48b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 956K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678517493108

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 06:51:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:51:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:51:35] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2023-03-11 06:51:35] [INFO ] Transformed 3950 places.
[2023-03-11 06:51:35] [INFO ] Transformed 3936 transitions.
[2023-03-11 06:51:35] [INFO ] Found NUPN structural information;
[2023-03-11 06:51:35] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutoFlight-PT-48b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 3950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Discarding 503 places :
Symmetric choice reduction at 0 with 503 rule applications. Total rules 503 place count 3447 transition count 3433
Iterating global reduction 0 with 503 rules applied. Total rules applied 1006 place count 3447 transition count 3433
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 1078 place count 3447 transition count 3361
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1315 place count 3210 transition count 3124
Iterating global reduction 1 with 237 rules applied. Total rules applied 1552 place count 3210 transition count 3124
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 1588 place count 3174 transition count 3088
Iterating global reduction 1 with 36 rules applied. Total rules applied 1624 place count 3174 transition count 3088
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 1659 place count 3139 transition count 3053
Iterating global reduction 1 with 35 rules applied. Total rules applied 1694 place count 3139 transition count 3053
Applied a total of 1694 rules in 1919 ms. Remains 3139 /3950 variables (removed 811) and now considering 3053/3936 (removed 883) transitions.
// Phase 1: matrix 3053 rows 3139 cols
[2023-03-11 06:51:38] [INFO ] Computed 258 place invariants in 114 ms
[2023-03-11 06:51:39] [INFO ] Implicit Places using invariants in 1254 ms returned []
[2023-03-11 06:51:39] [INFO ] Invariant cache hit.
[2023-03-11 06:51:44] [INFO ] Implicit Places using invariants and state equation in 5118 ms returned []
Implicit Place search using SMT with State Equation took 6417 ms to find 0 implicit places.
[2023-03-11 06:51:44] [INFO ] Invariant cache hit.
[2023-03-11 06:51:47] [INFO ] Dead Transitions using invariants and state equation in 3204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3139/3950 places, 3053/3936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11573 ms. Remains : 3139/3950 places, 3053/3936 transitions.
Support contains 25 out of 3139 places after structural reductions.
[2023-03-11 06:51:48] [INFO ] Flatten gal took : 204 ms
[2023-03-11 06:51:48] [INFO ] Flatten gal took : 113 ms
[2023-03-11 06:51:48] [INFO ] Input system was already deterministic with 3053 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 06:51:49] [INFO ] Invariant cache hit.
[2023-03-11 06:51:50] [INFO ] After 1179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 06:51:52] [INFO ] [Nat]Absence check using 257 positive place invariants in 280 ms returned sat
[2023-03-11 06:51:52] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-11 06:51:56] [INFO ] After 3330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-11 06:51:57] [INFO ] Deduced a trap composed of 101 places in 965 ms of which 18 ms to minimize.
[2023-03-11 06:51:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1317 ms
[2023-03-11 06:51:59] [INFO ] Deduced a trap composed of 67 places in 939 ms of which 15 ms to minimize.
[2023-03-11 06:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1292 ms
[2023-03-11 06:52:02] [INFO ] Deduced a trap composed of 142 places in 1220 ms of which 23 ms to minimize.
[2023-03-11 06:52:04] [INFO ] Deduced a trap composed of 241 places in 1700 ms of which 25 ms to minimize.
[2023-03-11 06:52:05] [INFO ] Deduced a trap composed of 97 places in 1111 ms of which 15 ms to minimize.
[2023-03-11 06:52:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4714 ms
[2023-03-11 06:52:07] [INFO ] Deduced a trap composed of 227 places in 1023 ms of which 2 ms to minimize.
[2023-03-11 06:52:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1339 ms
[2023-03-11 06:52:07] [INFO ] Deduced a trap composed of 69 places in 622 ms of which 1 ms to minimize.
[2023-03-11 06:52:08] [INFO ] Deduced a trap composed of 161 places in 706 ms of which 14 ms to minimize.
[2023-03-11 06:52:09] [INFO ] Deduced a trap composed of 162 places in 647 ms of which 4 ms to minimize.
[2023-03-11 06:52:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2438 ms
[2023-03-11 06:52:11] [INFO ] After 17684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 2145 ms.
[2023-03-11 06:52:13] [INFO ] After 22584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 10 properties in 875 ms.
Support contains 5 out of 3139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Drop transitions removed 1274 transitions
Trivial Post-agglo rules discarded 1274 transitions
Performed 1274 trivial Post agglomeration. Transition count delta: 1274
Iterating post reduction 0 with 1274 rules applied. Total rules applied 1274 place count 3139 transition count 1779
Reduce places removed 1274 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1419 rules applied. Total rules applied 2693 place count 1865 transition count 1634
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2790 place count 1769 transition count 1633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2791 place count 1768 transition count 1633
Performed 348 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 348 Pre rules applied. Total rules applied 2791 place count 1768 transition count 1285
Deduced a syphon composed of 348 places in 8 ms
Reduce places removed 348 places and 0 transitions.
Iterating global reduction 4 with 696 rules applied. Total rules applied 3487 place count 1420 transition count 1285
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 3492 place count 1415 transition count 1280
Iterating global reduction 4 with 5 rules applied. Total rules applied 3497 place count 1415 transition count 1280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3497 place count 1415 transition count 1278
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3501 place count 1413 transition count 1278
Performed 568 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 568 places in 1 ms
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 4 with 1136 rules applied. Total rules applied 4637 place count 845 transition count 639
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 143 times.
Iterating global reduction 4 with 143 rules applied. Total rules applied 4780 place count 845 transition count 496
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 4 with 143 rules applied. Total rules applied 4923 place count 702 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4924 place count 701 transition count 495
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 5 with 529 rules applied. Total rules applied 5453 place count 499 transition count 168
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 6 with 327 rules applied. Total rules applied 5780 place count 172 transition count 168
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 54 Pre rules applied. Total rules applied 5780 place count 172 transition count 114
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 5888 place count 118 transition count 114
Applied a total of 5888 rules in 656 ms. Remains 118 /3139 variables (removed 3021) and now considering 114/3053 (removed 2939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 118/3139 places, 114/3053 transitions.
Finished random walk after 5761 steps, including 22 resets, run visited all 3 properties in 44 ms. (steps per millisecond=130 )
FORMULA AutoFlight-PT-48b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 797 stabilizing places and 797 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1273 transitions
Trivial Post-agglo rules discarded 1273 transitions
Performed 1273 trivial Post agglomeration. Transition count delta: 1273
Iterating post reduction 0 with 1273 rules applied. Total rules applied 1273 place count 3138 transition count 1779
Reduce places removed 1273 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1418 rules applied. Total rules applied 2691 place count 1865 transition count 1634
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2787 place count 1769 transition count 1634
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2787 place count 1769 transition count 1282
Deduced a syphon composed of 352 places in 20 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3491 place count 1417 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3497 place count 1411 transition count 1276
Iterating global reduction 3 with 6 rules applied. Total rules applied 3503 place count 1411 transition count 1276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3503 place count 1411 transition count 1274
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3507 place count 1409 transition count 1274
Performed 567 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 567 places in 1 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4641 place count 842 transition count 636
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 4642 place count 841 transition count 635
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 140 rules applied. Total rules applied 4782 place count 747 transition count 589
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4828 place count 701 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4828 place count 701 transition count 541
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4924 place count 653 transition count 541
Applied a total of 4924 rules in 462 ms. Remains 653 /3139 variables (removed 2486) and now considering 541/3053 (removed 2512) transitions.
// Phase 1: matrix 541 rows 653 cols
[2023-03-11 06:52:15] [INFO ] Computed 164 place invariants in 6 ms
[2023-03-11 06:52:16] [INFO ] Implicit Places using invariants in 368 ms returned [257, 331, 369, 443, 481, 485, 489, 493, 497, 501, 505, 509, 513, 517, 521, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 579, 582, 584, 587, 589, 591, 593, 595, 597, 599, 601, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 643, 647, 652]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 372 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/3139 places, 541/3053 transitions.
Graph (trivial) has 248 edges and 600 vertex of which 11 / 600 are part of one of the 1 SCC in 3 ms
Free SCC test removed 10 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 549 transition count 481
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 549 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 547 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 545 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 543 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 541 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 539 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 537 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 535 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 531 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 529 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 527 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 525 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 525 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 524 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 154 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 155 place count 513 transition count 445
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 157 place count 512 transition count 444
Applied a total of 157 rules in 470 ms. Remains 512 /600 variables (removed 88) and now considering 444/541 (removed 97) transitions.
// Phase 1: matrix 444 rows 512 cols
[2023-03-11 06:52:16] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-11 06:52:16] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-11 06:52:16] [INFO ] Invariant cache hit.
[2023-03-11 06:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:52:17] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/3139 places, 444/3053 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2288 ms. Remains : 512/3139 places, 444/3053 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s256 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-00 finished in 2664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((G(p1)||X(p2))))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3131 transition count 3045
Applied a total of 16 rules in 943 ms. Remains 3131 /3139 variables (removed 8) and now considering 3045/3053 (removed 8) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2023-03-11 06:52:19] [INFO ] Computed 258 place invariants in 60 ms
[2023-03-11 06:52:19] [INFO ] Implicit Places using invariants in 934 ms returned []
[2023-03-11 06:52:19] [INFO ] Invariant cache hit.
[2023-03-11 06:52:27] [INFO ] Implicit Places using invariants and state equation in 7563 ms returned []
Implicit Place search using SMT with State Equation took 8559 ms to find 0 implicit places.
[2023-03-11 06:52:27] [INFO ] Invariant cache hit.
[2023-03-11 06:52:29] [INFO ] Dead Transitions using invariants and state equation in 2463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3139 places, 3045/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11967 ms. Remains : 3131/3139 places, 3045/3053 transitions.
Stuttering acceptance computed with spot in 727 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s2044 0), p1:(EQ s1363 0), p2:(EQ s2458 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 122 reset in 556 ms.
Product exploration explored 100000 steps with 106 reset in 552 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Detected a total of 791/3131 stabilizing places and 791/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1844 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 850 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 06:52:35] [INFO ] Invariant cache hit.
[2023-03-11 06:52:36] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 06:52:37] [INFO ] [Nat]Absence check using 257 positive place invariants in 237 ms returned sat
[2023-03-11 06:52:37] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-11 06:52:40] [INFO ] After 2787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 06:52:41] [INFO ] Deduced a trap composed of 31 places in 1003 ms of which 2 ms to minimize.
[2023-03-11 06:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1398 ms
[2023-03-11 06:52:43] [INFO ] Deduced a trap composed of 141 places in 1052 ms of which 2 ms to minimize.
[2023-03-11 06:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1400 ms
[2023-03-11 06:52:45] [INFO ] Deduced a trap composed of 59 places in 1199 ms of which 17 ms to minimize.
[2023-03-11 06:52:46] [INFO ] Deduced a trap composed of 67 places in 980 ms of which 32 ms to minimize.
[2023-03-11 06:52:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2696 ms
[2023-03-11 06:52:48] [INFO ] After 10144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1187 ms.
[2023-03-11 06:52:49] [INFO ] After 13155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 1532 steps, including 1 resets, run visited all 3 properties in 21 ms. (steps per millisecond=72 )
Parikh walk visited 8 properties in 231 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1560 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 760 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 778 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 414 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2023-03-11 06:52:53] [INFO ] Invariant cache hit.
[2023-03-11 06:52:54] [INFO ] Implicit Places using invariants in 1090 ms returned []
[2023-03-11 06:52:54] [INFO ] Invariant cache hit.
[2023-03-11 06:52:59] [INFO ] Implicit Places using invariants and state equation in 4819 ms returned []
Implicit Place search using SMT with State Equation took 5945 ms to find 0 implicit places.
[2023-03-11 06:52:59] [INFO ] Invariant cache hit.
[2023-03-11 06:53:01] [INFO ] Dead Transitions using invariants and state equation in 2824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9187 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Detected a total of 791/3131 stabilizing places and 791/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1235 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 628 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 06:53:04] [INFO ] Invariant cache hit.
[2023-03-11 06:53:05] [INFO ] After 814ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 06:53:06] [INFO ] [Nat]Absence check using 257 positive place invariants in 208 ms returned sat
[2023-03-11 06:53:06] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-11 06:53:09] [INFO ] After 3028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 06:53:11] [INFO ] Deduced a trap composed of 31 places in 1363 ms of which 2 ms to minimize.
[2023-03-11 06:53:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1709 ms
[2023-03-11 06:53:12] [INFO ] Deduced a trap composed of 141 places in 947 ms of which 2 ms to minimize.
[2023-03-11 06:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1256 ms
[2023-03-11 06:53:14] [INFO ] Deduced a trap composed of 59 places in 1058 ms of which 9 ms to minimize.
[2023-03-11 06:53:15] [INFO ] Deduced a trap composed of 67 places in 1142 ms of which 2 ms to minimize.
[2023-03-11 06:53:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2629 ms
[2023-03-11 06:53:17] [INFO ] After 10884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1125 ms.
[2023-03-11 06:53:18] [INFO ] After 13835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 748 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=149 )
Parikh walk visited 8 properties in 107 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1795 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 810 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 837 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 832 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 136 reset in 682 ms.
Product exploration explored 100000 steps with 134 reset in 641 ms.
Built C files in :
/tmp/ltsmin12171256034981667347
[2023-03-11 06:53:25] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12171256034981667347
Running compilation step : cd /tmp/ltsmin12171256034981667347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12171256034981667347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12171256034981667347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 278 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2023-03-11 06:53:28] [INFO ] Invariant cache hit.
[2023-03-11 06:53:29] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2023-03-11 06:53:29] [INFO ] Invariant cache hit.
[2023-03-11 06:53:34] [INFO ] Implicit Places using invariants and state equation in 4865 ms returned []
Implicit Place search using SMT with State Equation took 6063 ms to find 0 implicit places.
[2023-03-11 06:53:34] [INFO ] Invariant cache hit.
[2023-03-11 06:53:36] [INFO ] Dead Transitions using invariants and state equation in 2351 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8707 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Built C files in :
/tmp/ltsmin11463617106352399349
[2023-03-11 06:53:37] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11463617106352399349
Running compilation step : cd /tmp/ltsmin11463617106352399349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11463617106352399349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11463617106352399349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 06:53:40] [INFO ] Flatten gal took : 90 ms
[2023-03-11 06:53:40] [INFO ] Flatten gal took : 89 ms
[2023-03-11 06:53:40] [INFO ] Time to serialize gal into /tmp/LTL3169220747938051766.gal : 22 ms
[2023-03-11 06:53:40] [INFO ] Time to serialize properties into /tmp/LTL12737558309099203480.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3169220747938051766.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16616312594688264391.hoa' '-atoms' '/tmp/LTL12737558309099203480.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12737558309099203480.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16616312594688264391.hoa
Detected timeout of ITS tools.
[2023-03-11 06:53:55] [INFO ] Flatten gal took : 74 ms
[2023-03-11 06:53:55] [INFO ] Flatten gal took : 71 ms
[2023-03-11 06:53:55] [INFO ] Time to serialize gal into /tmp/LTL6231229171855804220.gal : 11 ms
[2023-03-11 06:53:55] [INFO ] Time to serialize properties into /tmp/LTL7736590497871746480.ltl : 6 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6231229171855804220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7736590497871746480.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("(p2813==0)"))&&(X((G("(p2039==0)"))||(X("(p3235==0)")))))))
Formula 0 simplified : G(F!"(p2813==0)" | X(F!"(p2039==0)" & X!"(p3235==0)"))
Detected timeout of ITS tools.
[2023-03-11 06:54:11] [INFO ] Flatten gal took : 102 ms
[2023-03-11 06:54:11] [INFO ] Applying decomposition
[2023-03-11 06:54:11] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1382975598270770530.txt' '-o' '/tmp/graph1382975598270770530.bin' '-w' '/tmp/graph1382975598270770530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1382975598270770530.bin' '-l' '-1' '-v' '-w' '/tmp/graph1382975598270770530.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:54:12] [INFO ] Decomposing Gal with order
[2023-03-11 06:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:54:13] [INFO ] Removed a total of 560 redundant transitions.
[2023-03-11 06:54:13] [INFO ] Flatten gal took : 483 ms
[2023-03-11 06:54:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-11 06:54:13] [INFO ] Time to serialize gal into /tmp/LTL2582966203695351803.gal : 29 ms
[2023-03-11 06:54:13] [INFO ] Time to serialize properties into /tmp/LTL526735703532427043.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2582966203695351803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL526735703532427043.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("(i38.i0.i0.i1.u861.p2813==0)"))&&(X((G("(i48.u576.p2039==0)"))||(X("(i10.u1044.p3235==0)")))))))
Formula 0 simplified : G(F!"(i38.i0.i0.i1.u861.p2813==0)" | X(F!"(i48.u576.p2039==0)" & X!"(i10.u1044.p3235==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17003325343454146
[2023-03-11 06:54:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17003325343454146
Running compilation step : cd /tmp/ltsmin17003325343454146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17003325343454146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17003325343454146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 133705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1275 transitions
Trivial Post-agglo rules discarded 1275 transitions
Performed 1275 trivial Post agglomeration. Transition count delta: 1275
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1275 place count 3138 transition count 1777
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1420 rules applied. Total rules applied 2695 place count 1863 transition count 1632
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2791 place count 1767 transition count 1632
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 351 Pre rules applied. Total rules applied 2791 place count 1767 transition count 1281
Deduced a syphon composed of 351 places in 7 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 3 with 702 rules applied. Total rules applied 3493 place count 1416 transition count 1281
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3499 place count 1410 transition count 1275
Iterating global reduction 3 with 6 rules applied. Total rules applied 3505 place count 1410 transition count 1275
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3505 place count 1410 transition count 1273
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3509 place count 1408 transition count 1273
Performed 567 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 567 places in 0 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4643 place count 841 transition count 635
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 4644 place count 840 transition count 634
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 140 rules applied. Total rules applied 4784 place count 746 transition count 588
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4830 place count 700 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4830 place count 700 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4926 place count 652 transition count 540
Applied a total of 4926 rules in 428 ms. Remains 652 /3139 variables (removed 2487) and now considering 540/3053 (removed 2513) transitions.
// Phase 1: matrix 540 rows 652 cols
[2023-03-11 06:54:32] [INFO ] Computed 164 place invariants in 12 ms
[2023-03-11 06:54:32] [INFO ] Implicit Places using invariants in 436 ms returned [256, 330, 368, 442, 480, 484, 488, 492, 496, 500, 504, 508, 512, 516, 520, 524, 528, 532, 536, 540, 544, 548, 552, 556, 560, 564, 568, 572, 576, 578, 581, 583, 585, 587, 589, 591, 593, 595, 598, 600, 602, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 646, 651]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 438 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/3139 places, 540/3053 transitions.
Graph (trivial) has 247 edges and 599 vertex of which 11 / 599 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 548 transition count 480
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 548 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 546 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 546 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 544 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 544 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 542 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 542 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 540 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 540 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 538 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 538 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 536 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 536 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 534 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 532 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 530 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 530 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 528 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 528 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 526 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 526 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 524 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 513 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 154 place count 512 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 155 place count 512 transition count 444
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 157 place count 511 transition count 443
Applied a total of 157 rules in 261 ms. Remains 511 /599 variables (removed 88) and now considering 443/540 (removed 97) transitions.
// Phase 1: matrix 443 rows 511 cols
[2023-03-11 06:54:32] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-11 06:54:33] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-11 06:54:33] [INFO ] Invariant cache hit.
[2023-03-11 06:54:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:54:33] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 511/3139 places, 443/3053 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2179 ms. Remains : 511/3139 places, 443/3053 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s255 0) (EQ s485 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 860 reset in 678 ms.
Product exploration explored 100000 steps with 864 reset in 640 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 4069 steps, including 34 resets, run visited all 1 properties in 36 ms. (steps per millisecond=113 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 443/443 transitions.
Applied a total of 0 rules in 26 ms. Remains 511 /511 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-11 06:54:36] [INFO ] Invariant cache hit.
[2023-03-11 06:54:36] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-11 06:54:36] [INFO ] Invariant cache hit.
[2023-03-11 06:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:54:37] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2023-03-11 06:54:37] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-11 06:54:37] [INFO ] Invariant cache hit.
[2023-03-11 06:54:37] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1406 ms. Remains : 511/511 places, 443/443 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 2875 steps, including 25 resets, run visited all 1 properties in 42 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 860 reset in 618 ms.
Product exploration explored 100000 steps with 855 reset in 562 ms.
Built C files in :
/tmp/ltsmin10944698342984226955
[2023-03-11 06:54:39] [INFO ] Computing symmetric may disable matrix : 443 transitions.
[2023-03-11 06:54:39] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:54:39] [INFO ] Computing symmetric may enable matrix : 443 transitions.
[2023-03-11 06:54:39] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:54:39] [INFO ] Computing Do-Not-Accords matrix : 443 transitions.
[2023-03-11 06:54:39] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:54:39] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10944698342984226955
Running compilation step : cd /tmp/ltsmin10944698342984226955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 928 ms.
Running link step : cd /tmp/ltsmin10944698342984226955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin10944698342984226955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4731504994760538430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 443/443 transitions.
Applied a total of 0 rules in 21 ms. Remains 511 /511 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-11 06:54:54] [INFO ] Invariant cache hit.
[2023-03-11 06:54:54] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-11 06:54:54] [INFO ] Invariant cache hit.
[2023-03-11 06:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:54:55] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-03-11 06:54:55] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 06:54:55] [INFO ] Invariant cache hit.
[2023-03-11 06:54:55] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1515 ms. Remains : 511/511 places, 443/443 transitions.
Built C files in :
/tmp/ltsmin18069393995439115726
[2023-03-11 06:54:55] [INFO ] Computing symmetric may disable matrix : 443 transitions.
[2023-03-11 06:54:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:54:55] [INFO ] Computing symmetric may enable matrix : 443 transitions.
[2023-03-11 06:54:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:54:56] [INFO ] Computing Do-Not-Accords matrix : 443 transitions.
[2023-03-11 06:54:56] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:54:56] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18069393995439115726
Running compilation step : cd /tmp/ltsmin18069393995439115726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 933 ms.
Running link step : cd /tmp/ltsmin18069393995439115726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin18069393995439115726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2094153193757344100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:55:11] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:55:11] [INFO ] Flatten gal took : 19 ms
[2023-03-11 06:55:11] [INFO ] Time to serialize gal into /tmp/LTL2783853798026181694.gal : 2 ms
[2023-03-11 06:55:11] [INFO ] Time to serialize properties into /tmp/LTL3489580562448194895.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2783853798026181694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1406109360481235693.hoa' '-atoms' '/tmp/LTL3489580562448194895.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3489580562448194895.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1406109360481235693.hoa
Detected timeout of ITS tools.
[2023-03-11 06:55:26] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:55:26] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:55:26] [INFO ] Time to serialize gal into /tmp/LTL16961929856241431230.gal : 2 ms
[2023-03-11 06:55:26] [INFO ] Time to serialize properties into /tmp/LTL1334119904988493451.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16961929856241431230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1334119904988493451.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p2187==0)||(p3699==0))"))))
Formula 0 simplified : GF!"((p2187==0)||(p3699==0))"
Detected timeout of ITS tools.
[2023-03-11 06:55:41] [INFO ] Flatten gal took : 30 ms
[2023-03-11 06:55:41] [INFO ] Applying decomposition
[2023-03-11 06:55:41] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11588247186230249389.txt' '-o' '/tmp/graph11588247186230249389.bin' '-w' '/tmp/graph11588247186230249389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11588247186230249389.bin' '-l' '-1' '-v' '-w' '/tmp/graph11588247186230249389.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:55:41] [INFO ] Decomposing Gal with order
[2023-03-11 06:55:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:55:41] [INFO ] Removed a total of 3 redundant transitions.
[2023-03-11 06:55:41] [INFO ] Flatten gal took : 30 ms
[2023-03-11 06:55:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-11 06:55:41] [INFO ] Time to serialize gal into /tmp/LTL11292582843562008916.gal : 5 ms
[2023-03-11 06:55:41] [INFO ] Time to serialize properties into /tmp/LTL10610177703234221800.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11292582843562008916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10610177703234221800.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((u109.p2187==0)||(u188.p3699==0))"))))
Formula 0 simplified : GF!"((u109.p2187==0)||(u188.p3699==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.97912e+13 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2619453953113822128
[2023-03-11 06:55:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2619453953113822128
Running compilation step : cd /tmp/ltsmin2619453953113822128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 699 ms.
Running link step : cd /tmp/ltsmin2619453953113822128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2619453953113822128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-48b-LTLFireability-03 finished in 100049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1)))))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3132 transition count 3046
Applied a total of 14 rules in 971 ms. Remains 3132 /3139 variables (removed 7) and now considering 3046/3053 (removed 7) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2023-03-11 06:56:12] [INFO ] Computed 258 place invariants in 26 ms
[2023-03-11 06:56:14] [INFO ] Implicit Places using invariants in 1290 ms returned []
[2023-03-11 06:56:14] [INFO ] Invariant cache hit.
[2023-03-11 06:56:19] [INFO ] Implicit Places using invariants and state equation in 5556 ms returned []
Implicit Place search using SMT with State Equation took 6858 ms to find 0 implicit places.
[2023-03-11 06:56:19] [INFO ] Invariant cache hit.
[2023-03-11 06:56:22] [INFO ] Dead Transitions using invariants and state equation in 3158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3139 places, 3046/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11001 ms. Remains : 3132/3139 places, 3046/3053 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s365 1), p1:(EQ s950 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-06 finished in 11303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&F(p2)))))'
Support contains 4 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3131 transition count 3045
Applied a total of 16 rules in 1002 ms. Remains 3131 /3139 variables (removed 8) and now considering 3045/3053 (removed 8) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2023-03-11 06:56:24] [INFO ] Computed 258 place invariants in 18 ms
[2023-03-11 06:56:25] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2023-03-11 06:56:25] [INFO ] Invariant cache hit.
[2023-03-11 06:56:29] [INFO ] Implicit Places using invariants and state equation in 4810 ms returned []
Implicit Place search using SMT with State Equation took 5881 ms to find 0 implicit places.
[2023-03-11 06:56:29] [INFO ] Invariant cache hit.
[2023-03-11 06:56:32] [INFO ] Dead Transitions using invariants and state equation in 2747 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3139 places, 3045/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9633 ms. Remains : 3131/3139 places, 3045/3053 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s3031 1), p1:(EQ s48 1), p2:(AND (EQ s2488 1) (EQ s3129 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1861 steps with 0 reset in 21 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-07 finished in 10043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(!(p0 U p1)))||!(p1 U X((p1 U p2)))))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3132 transition count 3046
Applied a total of 14 rules in 992 ms. Remains 3132 /3139 variables (removed 7) and now considering 3046/3053 (removed 7) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2023-03-11 06:56:34] [INFO ] Computed 258 place invariants in 27 ms
[2023-03-11 06:56:35] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2023-03-11 06:56:35] [INFO ] Invariant cache hit.
[2023-03-11 06:56:40] [INFO ] Implicit Places using invariants and state equation in 5241 ms returned []
Implicit Place search using SMT with State Equation took 6500 ms to find 0 implicit places.
[2023-03-11 06:56:40] [INFO ] Invariant cache hit.
[2023-03-11 06:56:43] [INFO ] Dead Transitions using invariants and state equation in 3171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3139 places, 3046/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10686 ms. Remains : 3132/3139 places, 3046/3053 transitions.
Stuttering acceptance computed with spot in 327 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), false]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1967 1), p2:(EQ s524 1), p0:(EQ s1125 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1222 ms.
Product exploration explored 100000 steps with 33333 reset in 1242 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p2) (NOT p0))
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLFireability-10 finished in 13986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U G((p0 U p1))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3132 transition count 3046
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3132 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3130 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3130 transition count 3044
Applied a total of 18 rules in 860 ms. Remains 3130 /3139 variables (removed 9) and now considering 3044/3053 (removed 9) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2023-03-11 06:56:47] [INFO ] Computed 258 place invariants in 26 ms
[2023-03-11 06:56:49] [INFO ] Implicit Places using invariants in 1152 ms returned []
[2023-03-11 06:56:49] [INFO ] Invariant cache hit.
[2023-03-11 06:56:54] [INFO ] Implicit Places using invariants and state equation in 5251 ms returned []
Implicit Place search using SMT with State Equation took 6448 ms to find 0 implicit places.
[2023-03-11 06:56:54] [INFO ] Invariant cache hit.
[2023-03-11 06:56:56] [INFO ] Dead Transitions using invariants and state equation in 2020 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3139 places, 3044/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9352 ms. Remains : 3130/3139 places, 3044/3053 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), p0, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s250 1), p0:(AND (EQ s2831 1) (EQ s3126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33492 reset in 1282 ms.
Product exploration explored 100000 steps with 33182 reset in 1237 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 886 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:57:00] [INFO ] Invariant cache hit.
[2023-03-11 06:57:01] [INFO ] [Real]Absence check using 257 positive place invariants in 339 ms returned sat
[2023-03-11 06:57:01] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-11 06:57:01] [INFO ] After 958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:57:02] [INFO ] [Nat]Absence check using 257 positive place invariants in 323 ms returned sat
[2023-03-11 06:57:02] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-11 06:57:04] [INFO ] After 2082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:57:06] [INFO ] Deduced a trap composed of 37 places in 1185 ms of which 15 ms to minimize.
[2023-03-11 06:57:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1502 ms
[2023-03-11 06:57:06] [INFO ] After 4197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 397 ms.
[2023-03-11 06:57:07] [INFO ] After 5536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 119 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (OR p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 702 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2023-03-11 06:57:08] [INFO ] Invariant cache hit.
[2023-03-11 06:57:10] [INFO ] [Real]Absence check using 257 positive place invariants in 351 ms returned sat
[2023-03-11 06:57:10] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 19 ms returned sat
[2023-03-11 06:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:57:23] [INFO ] [Real]Absence check using state equation in 13136 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 3130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3130/3130 places, 3044/3044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1269 transitions
Trivial Post-agglo rules discarded 1269 transitions
Performed 1269 trivial Post agglomeration. Transition count delta: 1269
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1269 place count 3129 transition count 1774
Reduce places removed 1269 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1413 rules applied. Total rules applied 2682 place count 1860 transition count 1630
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2779 place count 1764 transition count 1629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2780 place count 1763 transition count 1629
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 2780 place count 1763 transition count 1279
Deduced a syphon composed of 350 places in 6 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 3480 place count 1413 transition count 1279
Performed 570 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 570 places in 0 ms
Reduce places removed 570 places and 0 transitions.
Iterating global reduction 4 with 1140 rules applied. Total rules applied 4620 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4621 place count 842 transition count 636
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 4 with 144 rules applied. Total rules applied 4765 place count 746 transition count 588
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 4813 place count 698 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4813 place count 698 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4909 place count 650 transition count 540
Applied a total of 4909 rules in 375 ms. Remains 650 /3130 variables (removed 2480) and now considering 540/3044 (removed 2504) transitions.
// Phase 1: matrix 540 rows 650 cols
[2023-03-11 06:57:23] [INFO ] Computed 162 place invariants in 5 ms
[2023-03-11 06:57:24] [INFO ] Implicit Places using invariants in 410 ms returned [254, 328, 366, 440, 478, 482, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 526, 530, 534, 538, 542, 546, 550, 554, 558, 562, 566, 570, 574, 576, 578, 580, 582, 587, 589, 591, 593, 595, 597, 599, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 643, 649]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 411 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/3130 places, 540/3044 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 598 transition count 528
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 586 transition count 518
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 73 place count 547 transition count 479
Iterating global reduction 2 with 39 rules applied. Total rules applied 112 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 545 transition count 477
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 543 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 541 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 539 transition count 471
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 537 transition count 469
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 535 transition count 467
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 533 transition count 465
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 531 transition count 463
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 529 transition count 461
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 527 transition count 459
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 525 transition count 457
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 525 transition count 457
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 523 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 522 transition count 454
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 521 transition count 453
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 520 transition count 452
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 519 transition count 451
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 518 transition count 450
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 517 transition count 449
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 516 transition count 448
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 515 transition count 447
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 514 transition count 446
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 513 transition count 445
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 513 transition count 445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 512 transition count 444
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 512 transition count 444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 511 transition count 443
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 511 transition count 443
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 2 with 2 rules applied. Total rules applied 186 place count 510 transition count 442
Applied a total of 186 rules in 206 ms. Remains 510 /598 variables (removed 88) and now considering 442/540 (removed 98) transitions.
// Phase 1: matrix 442 rows 510 cols
[2023-03-11 06:57:24] [INFO ] Computed 110 place invariants in 4 ms
[2023-03-11 06:57:24] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-11 06:57:24] [INFO ] Invariant cache hit.
[2023-03-11 06:57:25] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/3130 places, 442/3044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2050 ms. Remains : 510/3130 places, 442/3044 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 584 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 737 steps, including 6 resets, run visited all 5 properties in 38 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (AND p1 (NOT p0))), (F p0), (F (OR p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 701 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2023-03-11 06:57:27] [INFO ] Invariant cache hit.
[2023-03-11 06:57:28] [INFO ] [Real]Absence check using 110 positive place invariants in 29 ms returned sat
[2023-03-11 06:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:57:28] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2023-03-11 06:57:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:57:29] [INFO ] [Nat]Absence check using 110 positive place invariants in 27 ms returned sat
[2023-03-11 06:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:57:29] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2023-03-11 06:57:29] [INFO ] Computed and/alt/rep : 297/488/297 causal constraints (skipped 1 transitions) in 41 ms.
[2023-03-11 06:57:30] [INFO ] Added : 3 causal constraints over 2 iterations in 181 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 25652 steps with 7725 reset in 264 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-13 finished in 43505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3132 transition count 3046
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3132 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3130 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3130 transition count 3044
Applied a total of 18 rules in 788 ms. Remains 3130 /3139 variables (removed 9) and now considering 3044/3053 (removed 9) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2023-03-11 06:57:31] [INFO ] Computed 258 place invariants in 26 ms
[2023-03-11 06:57:32] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2023-03-11 06:57:32] [INFO ] Invariant cache hit.
[2023-03-11 06:57:37] [INFO ] Implicit Places using invariants and state equation in 4988 ms returned []
Implicit Place search using SMT with State Equation took 6007 ms to find 0 implicit places.
[2023-03-11 06:57:37] [INFO ] Invariant cache hit.
[2023-03-11 06:57:39] [INFO ] Dead Transitions using invariants and state equation in 2107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3139 places, 3044/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8917 ms. Remains : 3130/3139 places, 3044/3053 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s1699 1), p0:(EQ s2436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1466 ms.
Product exploration explored 100000 steps with 50000 reset in 1677 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Detected a total of 790/3130 stabilizing places and 790/3044 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 273 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLFireability-14 finished in 12573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((G(p1)||X(p2))))))'
Found a Shortening insensitive property : AutoFlight-PT-48b-LTLFireability-01
Stuttering acceptance computed with spot in 663 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1272 transitions
Trivial Post-agglo rules discarded 1272 transitions
Performed 1272 trivial Post agglomeration. Transition count delta: 1272
Iterating post reduction 0 with 1272 rules applied. Total rules applied 1272 place count 3138 transition count 1780
Reduce places removed 1272 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1417 rules applied. Total rules applied 2689 place count 1866 transition count 1635
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2786 place count 1770 transition count 1634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2787 place count 1769 transition count 1634
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 2787 place count 1769 transition count 1284
Deduced a syphon composed of 350 places in 9 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 3487 place count 1419 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 3492 place count 1414 transition count 1279
Iterating global reduction 4 with 5 rules applied. Total rules applied 3497 place count 1414 transition count 1279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3497 place count 1414 transition count 1277
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3501 place count 1412 transition count 1277
Performed 569 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 569 places in 0 ms
Reduce places removed 569 places and 0 transitions.
Iterating global reduction 4 with 1138 rules applied. Total rules applied 4639 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4640 place count 842 transition count 636
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 142 rules applied. Total rules applied 4782 place count 747 transition count 589
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 4829 place count 700 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4829 place count 700 transition count 541
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4925 place count 652 transition count 541
Applied a total of 4925 rules in 422 ms. Remains 652 /3139 variables (removed 2487) and now considering 541/3053 (removed 2512) transitions.
// Phase 1: matrix 541 rows 652 cols
[2023-03-11 06:57:44] [INFO ] Computed 163 place invariants in 2 ms
[2023-03-11 06:57:44] [INFO ] Implicit Places using invariants in 371 ms returned [254, 368, 442, 480, 484, 488, 492, 496, 500, 504, 509, 513, 517, 521, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 579, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 602, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 646, 651]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 374 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 600/3139 places, 541/3053 transitions.
Graph (trivial) has 246 edges and 600 vertex of which 12 / 600 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 589 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 588 transition count 519
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 41 place count 550 transition count 481
Iterating global reduction 2 with 38 rules applied. Total rules applied 79 place count 550 transition count 481
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 549 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 549 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 548 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 548 transition count 479
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 547 transition count 478
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 547 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 546 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 546 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 545 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 545 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 544 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 544 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 543 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 543 transition count 474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 542 transition count 473
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 542 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 541 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 541 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 540 transition count 471
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 540 transition count 471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 539 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 539 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 538 transition count 469
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 538 transition count 469
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 537 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 537 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 536 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 536 transition count 467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 535 transition count 466
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 535 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 534 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 534 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 533 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 533 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 532 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 532 transition count 463
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 531 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 531 transition count 462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 530 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 530 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 529 transition count 460
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 529 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 528 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 528 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 527 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 527 transition count 458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 526 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 526 transition count 457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 524 transition count 455
Applied a total of 131 rules in 183 ms. Remains 524 /600 variables (removed 76) and now considering 455/541 (removed 86) transitions.
// Phase 1: matrix 455 rows 524 cols
[2023-03-11 06:57:44] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-11 06:57:45] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-11 06:57:45] [INFO ] Invariant cache hit.
[2023-03-11 06:57:45] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 524/3139 places, 455/3053 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1943 ms. Remains : 524/3139 places, 455/3053 transitions.
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s364 0), p1:(EQ s253 0), p2:(EQ s461 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2283 steps with 53 reset in 20 ms.
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 2761 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-11 06:57:46] [INFO ] Flatten gal took : 94 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14001433300137406759
[2023-03-11 06:57:46] [INFO ] Too many transitions (3053) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:57:46] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14001433300137406759
[2023-03-11 06:57:46] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin14001433300137406759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 06:57:46] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13061341295554859756.txt' '-o' '/tmp/graph13061341295554859756.bin' '-w' '/tmp/graph13061341295554859756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13061341295554859756.bin' '-l' '-1' '-v' '-w' '/tmp/graph13061341295554859756.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:57:46] [INFO ] Decomposing Gal with order
[2023-03-11 06:57:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:57:46] [INFO ] Removed a total of 554 redundant transitions.
[2023-03-11 06:57:46] [INFO ] Flatten gal took : 141 ms
[2023-03-11 06:57:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-11 06:57:47] [INFO ] Time to serialize gal into /tmp/LTLFireability9582326093250783153.gal : 32 ms
[2023-03-11 06:57:47] [INFO ] Time to serialize properties into /tmp/LTLFireability17235403590692840166.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9582326093250783153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17235403590692840166.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("(i40.i0.i0.i2.u856.p2813==0)"))&&(X((G("(i2.u572.p2039==0)"))||(X("(i13.u1040.p3235==0)")))))))
Formula 0 simplified : G(F!"(i40.i0.i0.i2.u856.p2813==0)" | X(F!"(i2.u572.p2039==0)" & X!"(i13.u1040.p3235==0)"))
Compilation finished in 7532 ms.
Running link step : cd /tmp/ltsmin14001433300137406759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin14001433300137406759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 07:20:03] [INFO ] Applying decomposition
[2023-03-11 07:20:04] [INFO ] Flatten gal took : 614 ms
[2023-03-11 07:20:05] [INFO ] Decomposing Gal with order
[2023-03-11 07:20:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:20:16] [INFO ] Removed a total of 102 redundant transitions.
[2023-03-11 07:20:16] [INFO ] Flatten gal took : 488 ms
[2023-03-11 07:20:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2754 labels/synchronizations in 14476 ms.
[2023-03-11 07:20:39] [INFO ] Time to serialize gal into /tmp/LTLFireability1939029405933302184.gal : 5243 ms
[2023-03-11 07:20:40] [INFO ] Time to serialize properties into /tmp/LTLFireability14241597772113524447.ltl : 7 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1939029405933302184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14241597772113524447.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("(i1.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.i0.i...527
Formula 0 simplified : G(F!"(i1.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.i0.i0....515
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14001433300137406759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14001433300137406759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 07:42:47] [INFO ] Flatten gal took : 742 ms
[2023-03-11 07:42:51] [INFO ] Input system was already deterministic with 3053 transitions.
[2023-03-11 07:42:52] [INFO ] Transformed 3139 places.
[2023-03-11 07:42:52] [INFO ] Transformed 3053 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
[2023-03-11 07:42:54] [INFO ] Time to serialize gal into /tmp/LTLFireability2211351245419896041.gal : 25 ms
[2023-03-11 07:42:54] [INFO ] Time to serialize properties into /tmp/LTLFireability2540496291457803132.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2211351245419896041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2540496291457803132.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(p2813==0)"))&&(X((G("(p2039==0)"))||(X("(p3235==0)")))))))
Formula 0 simplified : G(F!"(p2813==0)" | X(F!"(p2039==0)" & X!"(p3235==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11924876 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15859872 kB

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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