fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813593100444
Last Updated
May 14, 2023

About the Execution of ITS-Tools for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.256 3600000.00 8942029.00 135021.70 FFFFFFFFFFTFFF?F normal

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-167813593100444.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-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593100444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:08 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.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 113K 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-05b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678513388209

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-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 05:43:10] [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 05:43:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:43:10] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-11 05:43:10] [INFO ] Transformed 482 places.
[2023-03-11 05:43:10] [INFO ] Transformed 480 transitions.
[2023-03-11 05:43:10] [INFO ] Found NUPN structural information;
[2023-03-11 05:43:10] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-05b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 423 transition count 421
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 423 transition count 421
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 126 place count 423 transition count 413
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 150 place count 399 transition count 389
Iterating global reduction 1 with 24 rules applied. Total rules applied 174 place count 399 transition count 389
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 178 place count 395 transition count 385
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 395 transition count 385
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 393 transition count 383
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 393 transition count 383
Applied a total of 186 rules in 134 ms. Remains 393 /482 variables (removed 89) and now considering 383/480 (removed 97) transitions.
// Phase 1: matrix 383 rows 393 cols
[2023-03-11 05:43:11] [INFO ] Computed 34 place invariants in 18 ms
[2023-03-11 05:43:11] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-11 05:43:11] [INFO ] Invariant cache hit.
[2023-03-11 05:43:12] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2023-03-11 05:43:12] [INFO ] Invariant cache hit.
[2023-03-11 05:43:12] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/482 places, 383/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1575 ms. Remains : 393/482 places, 383/480 transitions.
Support contains 31 out of 393 places after structural reductions.
[2023-03-11 05:43:12] [INFO ] Flatten gal took : 81 ms
[2023-03-11 05:43:12] [INFO ] Flatten gal took : 21 ms
[2023-03-11 05:43:12] [INFO ] Input system was already deterministic with 383 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:43:13] [INFO ] Invariant cache hit.
[2023-03-11 05:43:13] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-11 05:43:13] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 05:43:13] [INFO ] After 287ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2023-03-11 05:43:14] [INFO ] After 475ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:3
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-11 05:43:14] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:43:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2023-03-11 05:43:14] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 05:43:14] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:43:15] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 1 ms to minimize.
[2023-03-11 05:43:15] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2023-03-11 05:43:15] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 12 ms to minimize.
[2023-03-11 05:43:15] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2023-03-11 05:43:15] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 0 ms to minimize.
[2023-03-11 05:43:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 699 ms
[2023-03-11 05:43:15] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 1 ms to minimize.
[2023-03-11 05:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-11 05:43:15] [INFO ] After 1340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-11 05:43:16] [INFO ] After 1811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 131 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Parikh walk visited 6 properties in 36 ms.
Computed a total of 100 stabilizing places and 100 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' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 383 transition count 373
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 383 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 383 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 378 transition count 367
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 378 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 377 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 377 transition count 366
Applied a total of 33 rules in 72 ms. Remains 377 /393 variables (removed 16) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 377 cols
[2023-03-11 05:43:16] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-11 05:43:17] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-11 05:43:17] [INFO ] Invariant cache hit.
[2023-03-11 05:43:17] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-11 05:43:17] [INFO ] Invariant cache hit.
[2023-03-11 05:43:17] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 366/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 787 ms. Remains : 377/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 458 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s94 1), p1:(EQ s52 0), p2:(EQ s16 0)], 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-00 finished in 1394 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 U (p1||X(p0))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 377 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 377 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 376 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 376 transition count 364
Applied a total of 36 rules in 65 ms. Remains 376 /393 variables (removed 17) and now considering 364/383 (removed 19) transitions.
// Phase 1: matrix 364 rows 376 cols
[2023-03-11 05:43:18] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-11 05:43:18] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-11 05:43:18] [INFO ] Invariant cache hit.
[2023-03-11 05:43:18] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-11 05:43:18] [INFO ] Invariant cache hit.
[2023-03-11 05:43:18] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 364/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 376/393 places, 364/383 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s320 1), p1:(EQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-01 finished in 1007 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))'
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 392 transition count 246
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 154 rules applied. Total rules applied 290 place count 256 transition count 228
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 300 place count 246 transition count 228
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 300 place count 246 transition count 181
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 394 place count 199 transition count 181
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 403 place count 190 transition count 172
Iterating global reduction 3 with 9 rules applied. Total rules applied 412 place count 190 transition count 172
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 412 place count 190 transition count 168
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 420 place count 186 transition count 168
Performed 72 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 564 place count 114 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 113 transition count 86
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 578 place count 104 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 582 place count 100 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 582 place count 100 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 592 place count 95 transition count 77
Applied a total of 592 rules in 59 ms. Remains 95 /393 variables (removed 298) and now considering 77/383 (removed 306) transitions.
// Phase 1: matrix 77 rows 95 cols
[2023-03-11 05:43:19] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-11 05:43:19] [INFO ] Implicit Places using invariants in 62 ms returned [38, 55, 72, 76, 80, 84, 88, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 64 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/393 places, 77/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 71
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 66
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 24 place count 75 transition count 65
Applied a total of 24 rules in 12 ms. Remains 75 /87 variables (removed 12) and now considering 65/77 (removed 12) transitions.
// Phase 1: matrix 65 rows 75 cols
[2023-03-11 05:43:19] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-11 05:43:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 05:43:19] [INFO ] Invariant cache hit.
[2023-03-11 05:43:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/393 places, 65/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 270 ms. Remains : 75/393 places, 65/383 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-02 finished in 331 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' '!(((p0||X(G(p1))) U X(X(G(p2)))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 383 transition count 373
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 383 transition count 373
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 383 transition count 371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 379 transition count 367
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 379 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 378 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 378 transition count 366
Applied a total of 32 rules in 61 ms. Remains 378 /393 variables (removed 15) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-11 05:43:19] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-11 05:43:19] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-11 05:43:19] [INFO ] Invariant cache hit.
[2023-03-11 05:43:20] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-11 05:43:20] [INFO ] Invariant cache hit.
[2023-03-11 05:43:20] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/393 places, 366/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 760 ms. Remains : 378/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s27 1), p2:(EQ s93 1), p0:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 211 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-03 finished in 1094 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(F(p0)))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 392 transition count 248
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 152 rules applied. Total rules applied 286 place count 258 transition count 230
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 297 place count 248 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 247 transition count 229
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 298 place count 247 transition count 180
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 396 place count 198 transition count 180
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 405 place count 189 transition count 171
Iterating global reduction 4 with 9 rules applied. Total rules applied 414 place count 189 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 414 place count 189 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 420 place count 186 transition count 168
Performed 71 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 562 place count 115 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 563 place count 114 transition count 87
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 13 rules applied. Total rules applied 576 place count 105 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 580 place count 101 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 580 place count 101 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 590 place count 96 transition count 78
Applied a total of 590 rules in 44 ms. Remains 96 /393 variables (removed 297) and now considering 78/383 (removed 305) transitions.
// Phase 1: matrix 78 rows 96 cols
[2023-03-11 05:43:20] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-11 05:43:20] [INFO ] Implicit Places using invariants in 136 ms returned [38, 55, 73, 77, 81, 85, 89, 95]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 141 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/393 places, 78/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 68
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 22 place count 77 transition count 67
Applied a total of 22 rules in 7 ms. Remains 77 /88 variables (removed 11) and now considering 67/78 (removed 11) transitions.
// Phase 1: matrix 67 rows 77 cols
[2023-03-11 05:43:20] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 05:43:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 05:43:20] [INFO ] Invariant cache hit.
[2023-03-11 05:43:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:43:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/393 places, 67/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 331 ms. Remains : 77/393 places, 67/383 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-04 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:(AND (EQ s35 1) (EQ s53 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 27 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-04 finished in 491 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' '!(((p0||X(F(p1))) U (G((p0||X(F(p1))))||(!p0&&X(F(p1))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 381 transition count 371
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 381 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 381 transition count 369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 376 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 376 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 375 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 375 transition count 363
Applied a total of 38 rules in 46 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-11 05:43:21] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-11 05:43:21] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-11 05:43:21] [INFO ] Invariant cache hit.
[2023-03-11 05:43:21] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-11 05:43:21] [INFO ] Invariant cache hit.
[2023-03-11 05:43:21] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 815 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-05 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: 1}]], initial=1, aps=[p1:(EQ s54 1), p0:(EQ s94 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][false, false]]
Stuttering criterion allowed to conclude after 243 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-05 finished in 980 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)))'
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 381 transition count 371
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 381 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 381 transition count 369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 376 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 376 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 375 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 375 transition count 363
Applied a total of 38 rules in 42 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
[2023-03-11 05:43:22] [INFO ] Invariant cache hit.
[2023-03-11 05:43:22] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-11 05:43:22] [INFO ] Invariant cache hit.
[2023-03-11 05:43:22] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-11 05:43:22] [INFO ] Invariant cache hit.
[2023-03-11 05:43:22] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 790 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-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: 2}]], initial=1, aps=[p0:(EQ s250 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-06 finished in 929 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(((G(p0)||(X(p1)&&F(!p0))) U p2)))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 378 transition count 366
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 378 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 377 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 377 transition count 365
Applied a total of 34 rules in 73 ms. Remains 377 /393 variables (removed 16) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-11 05:43:23] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-11 05:43:23] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-11 05:43:23] [INFO ] Invariant cache hit.
[2023-03-11 05:43:23] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-11 05:43:23] [INFO ] Invariant cache hit.
[2023-03-11 05:43:23] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 365/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 377/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 430 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s115 1), p0:(EQ s149 1), p1:(EQ s315 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 406 reset in 308 ms.
Product exploration explored 100000 steps with 404 reset in 327 ms.
Computed a total of 92 stabilizing places and 92 stable transitions
Computed a total of 92 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1303 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:43:26] [INFO ] Invariant cache hit.
[2023-03-11 05:43:26] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-11 05:43:26] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 05:43:26] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 05:43:27] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 1 ms to minimize.
[2023-03-11 05:43:27] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 0 ms to minimize.
[2023-03-11 05:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2023-03-11 05:43:27] [INFO ] After 507ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:43:27] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:43:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-11 05:43:27] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 05:43:27] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:43:27] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 0 ms to minimize.
[2023-03-11 05:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-11 05:43:28] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-11 05:43:28] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 365/365 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 377 transition count 235
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 145 rules applied. Total rules applied 275 place count 247 transition count 220
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 285 place count 237 transition count 220
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 285 place count 237 transition count 173
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 379 place count 190 transition count 173
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 527 place count 116 transition count 89
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 547 place count 116 transition count 69
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 567 place count 96 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 95 transition count 68
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 56 rules applied. Total rules applied 624 place count 72 transition count 35
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 657 place count 39 transition count 35
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 657 place count 39 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 681 place count 27 transition count 23
Applied a total of 681 rules in 39 ms. Remains 27 /377 variables (removed 350) and now considering 23/365 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 27/377 places, 23/365 transitions.
Finished random walk after 458 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 1189 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 419 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2023-03-11 05:43:30] [INFO ] Invariant cache hit.
[2023-03-11 05:43:30] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-11 05:43:30] [INFO ] Invariant cache hit.
[2023-03-11 05:43:30] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2023-03-11 05:43:30] [INFO ] Invariant cache hit.
[2023-03-11 05:43:31] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1273 ms. Remains : 377/377 places, 365/365 transitions.
Computed a total of 92 stabilizing places and 92 stable transitions
Computed a total of 92 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1103 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:43:33] [INFO ] Invariant cache hit.
[2023-03-11 05:43:33] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-11 05:43:33] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-11 05:43:33] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 05:43:33] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 0 ms to minimize.
[2023-03-11 05:43:33] [INFO ] Deduced a trap composed of 72 places in 234 ms of which 1 ms to minimize.
[2023-03-11 05:43:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2023-03-11 05:43:33] [INFO ] After 569ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:43:33] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:43:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-11 05:43:34] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 47 ms returned sat
[2023-03-11 05:43:34] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:43:34] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 0 ms to minimize.
[2023-03-11 05:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-11 05:43:34] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-11 05:43:34] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 365/365 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 377 transition count 235
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 145 rules applied. Total rules applied 275 place count 247 transition count 220
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 285 place count 237 transition count 220
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 285 place count 237 transition count 173
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 379 place count 190 transition count 173
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 527 place count 116 transition count 89
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 547 place count 116 transition count 69
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 567 place count 96 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 95 transition count 68
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 56 rules applied. Total rules applied 624 place count 72 transition count 35
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 657 place count 39 transition count 35
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 657 place count 39 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 681 place count 27 transition count 23
Applied a total of 681 rules in 39 ms. Remains 27 /377 variables (removed 350) and now considering 23/365 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 27/377 places, 23/365 transitions.
Finished random walk after 689 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=344 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 986 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 394 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 505 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Product exploration explored 100000 steps with 404 reset in 232 ms.
Product exploration explored 100000 steps with 406 reset in 223 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 377 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 126 place count 377 transition count 360
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 126 place count 377 transition count 360
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 175 place count 377 transition count 360
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 272 place count 280 transition count 263
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 369 place count 280 transition count 263
Performed 90 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 459 place count 280 transition count 253
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 516 place count 223 transition count 196
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 573 place count 223 transition count 196
Deduced a syphon composed of 106 places in 0 ms
Applied a total of 573 rules in 107 ms. Remains 223 /377 variables (removed 154) and now considering 196/365 (removed 169) transitions.
[2023-03-11 05:43:38] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 196 rows 223 cols
[2023-03-11 05:43:38] [INFO ] Computed 34 place invariants in 30 ms
[2023-03-11 05:43:38] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/377 places, 196/365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 223/377 places, 196/365 transitions.
Built C files in :
/tmp/ltsmin10081578331297753982
[2023-03-11 05:43:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10081578331297753982
Running compilation step : cd /tmp/ltsmin10081578331297753982;'/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 683 ms.
Running link step : cd /tmp/ltsmin10081578331297753982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin10081578331297753982;'/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' '--hoa' '/tmp/stateBased2810768474691566481.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Applied a total of 0 rules in 22 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-11 05:43:53] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-11 05:43:53] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-11 05:43:53] [INFO ] Invariant cache hit.
[2023-03-11 05:43:54] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-11 05:43:54] [INFO ] Invariant cache hit.
[2023-03-11 05:43:54] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 377/377 places, 365/365 transitions.
Built C files in :
/tmp/ltsmin11473127501815158242
[2023-03-11 05:43:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11473127501815158242
Running compilation step : cd /tmp/ltsmin11473127501815158242;'/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 521 ms.
Running link step : cd /tmp/ltsmin11473127501815158242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11473127501815158242;'/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' '--hoa' '/tmp/stateBased8994714336010825316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:44:09] [INFO ] Flatten gal took : 16 ms
[2023-03-11 05:44:09] [INFO ] Flatten gal took : 15 ms
[2023-03-11 05:44:09] [INFO ] Time to serialize gal into /tmp/LTL16685330858847157443.gal : 4 ms
[2023-03-11 05:44:09] [INFO ] Time to serialize properties into /tmp/LTL9508785744876294967.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/LTL16685330858847157443.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11843872484426691768.hoa' '-atoms' '/tmp/LTL9508785744876294967.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/LTL9508785744876294967.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11843872484426691768.hoa
Detected timeout of ITS tools.
[2023-03-11 05:44:24] [INFO ] Flatten gal took : 50 ms
[2023-03-11 05:44:24] [INFO ] Flatten gal took : 28 ms
[2023-03-11 05:44:24] [INFO ] Time to serialize gal into /tmp/LTL7239804215945858474.gal : 4 ms
[2023-03-11 05:44:24] [INFO ] Time to serialize properties into /tmp/LTL13136997111390062606.ltl : 10 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/LTL7239804215945858474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13136997111390062606.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 : !((G(((G("(p228==1)"))||((X("(p416==1)"))&&(F("(p228!=1)"))))U("(p172!=1)"))))
Formula 0 simplified : F((F!"(p228==1)" & (X!"(p416==1)" | G!"(p228!=1)")) R !"(p172!=1)")
Detected timeout of ITS tools.
[2023-03-11 05:44:39] [INFO ] Flatten gal took : 36 ms
[2023-03-11 05:44:39] [INFO ] Applying decomposition
[2023-03-11 05:44:39] [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/graph12591972706958451891.txt' '-o' '/tmp/graph12591972706958451891.bin' '-w' '/tmp/graph12591972706958451891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12591972706958451891.bin' '-l' '-1' '-v' '-w' '/tmp/graph12591972706958451891.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:44:40] [INFO ] Decomposing Gal with order
[2023-03-11 05:44:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:44:40] [INFO ] Removed a total of 71 redundant transitions.
[2023-03-11 05:44:40] [INFO ] Flatten gal took : 52 ms
[2023-03-11 05:44:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-11 05:44:40] [INFO ] Time to serialize gal into /tmp/LTL16044837192960923497.gal : 5 ms
[2023-03-11 05:44:40] [INFO ] Time to serialize properties into /tmp/LTL14412588185898598670.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/LTL16044837192960923497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14412588185898598670.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 : !((G(((G("(i14.u65.p228==1)"))||((X("(i15.u134.p416==1)"))&&(F("(i14.u65.p228!=1)"))))U("(i10.u51.p172!=1)"))))
Formula 0 simplified : F((F!"(i14.u65.p228==1)" & (X!"(i15.u134.p416==1)" | G!"(i14.u65.p228!=1)")) R !"(i10.u51.p172!=1)")
Reverse transition relation is NOT exact ! Due to transitions t120, t131, t134, t147, t170, t173, t193, t200, t227, t244, t252, t291, t370, t371, t372, t37...858
Computing Next relation with stutter on 800 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8941239405282304769
[2023-03-11 05:44:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8941239405282304769
Running compilation step : cd /tmp/ltsmin8941239405282304769;'/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 455 ms.
Running link step : cd /tmp/ltsmin8941239405282304769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8941239405282304769;'/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))&&<>(!(LTLAPp0==true)))) U (LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-05b-LTLFireability-07 finished in 107502 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)&&F(p1)))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 378 transition count 366
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 378 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 377 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 377 transition count 365
Applied a total of 34 rules in 34 ms. Remains 377 /393 variables (removed 16) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-11 05:45:10] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-11 05:45:10] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-11 05:45:10] [INFO ] Invariant cache hit.
[2023-03-11 05:45:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2023-03-11 05:45:11] [INFO ] Invariant cache hit.
[2023-03-11 05:45:11] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 365/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 377/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s81 1), p0:(EQ s248 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 12 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-08 finished in 995 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(X(F((G(F(p0))||(p1&&F(p0)&&G(F(!p0))))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 379 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 379 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 378 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 378 transition count 366
Applied a total of 32 rules in 32 ms. Remains 378 /393 variables (removed 15) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-11 05:45:11] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-11 05:45:11] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-11 05:45:11] [INFO ] Invariant cache hit.
[2023-03-11 05:45:12] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-11 05:45:12] [INFO ] Invariant cache hit.
[2023-03-11 05:45:12] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/393 places, 366/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 892 ms. Remains : 378/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s87 1), p0:(NEQ s121 1)], nbAcceptance=1, 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 727 reset in 267 ms.
Product exploration explored 100000 steps with 723 reset in 319 ms.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Detected a total of 94/378 stabilizing places and 94/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 387 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 154 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 372 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Applied a total of 0 rules in 6 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2023-03-11 05:45:14] [INFO ] Invariant cache hit.
[2023-03-11 05:45:14] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-11 05:45:14] [INFO ] Invariant cache hit.
[2023-03-11 05:45:15] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-11 05:45:15] [INFO ] Invariant cache hit.
[2023-03-11 05:45:15] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 378/378 places, 366/366 transitions.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Detected a total of 94/378 stabilizing places and 94/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 153 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 366 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 727 reset in 182 ms.
Product exploration explored 100000 steps with 715 reset in 162 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 378 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 378 transition count 361
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 127 place count 378 transition count 361
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 178 place count 378 transition count 361
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 277 place count 279 transition count 262
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 376 place count 279 transition count 262
Performed 89 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 465 place count 279 transition count 252
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 522 place count 222 transition count 195
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 579 place count 222 transition count 195
Deduced a syphon composed of 106 places in 0 ms
Applied a total of 579 rules in 78 ms. Remains 222 /378 variables (removed 156) and now considering 195/366 (removed 171) transitions.
[2023-03-11 05:45:17] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 195 rows 222 cols
[2023-03-11 05:45:17] [INFO ] Computed 34 place invariants in 21 ms
[2023-03-11 05:45:17] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/378 places, 195/366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 222/378 places, 195/366 transitions.
Built C files in :
/tmp/ltsmin15296558548081584728
[2023-03-11 05:45:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15296558548081584728
Running compilation step : cd /tmp/ltsmin15296558548081584728;'/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 520 ms.
Running link step : cd /tmp/ltsmin15296558548081584728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15296558548081584728;'/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' '--hoa' '/tmp/stateBased2015924911252621436.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-11 05:45:33] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-11 05:45:33] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-11 05:45:33] [INFO ] Invariant cache hit.
[2023-03-11 05:45:33] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-03-11 05:45:33] [INFO ] Invariant cache hit.
[2023-03-11 05:45:34] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 935 ms. Remains : 378/378 places, 366/366 transitions.
Built C files in :
/tmp/ltsmin9647736889939953581
[2023-03-11 05:45:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9647736889939953581
Running compilation step : cd /tmp/ltsmin9647736889939953581;'/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 493 ms.
Running link step : cd /tmp/ltsmin9647736889939953581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9647736889939953581;'/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' '--hoa' '/tmp/stateBased557483542960214042.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:45:49] [INFO ] Flatten gal took : 22 ms
[2023-03-11 05:45:49] [INFO ] Flatten gal took : 15 ms
[2023-03-11 05:45:49] [INFO ] Time to serialize gal into /tmp/LTL12605780478270662241.gal : 3 ms
[2023-03-11 05:45:49] [INFO ] Time to serialize properties into /tmp/LTL8568358378774610092.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/LTL12605780478270662241.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4609449779690387875.hoa' '-atoms' '/tmp/LTL8568358378774610092.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...318
Loading property file /tmp/LTL8568358378774610092.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4609449779690387875.hoa
Detected timeout of ITS tools.
[2023-03-11 05:46:04] [INFO ] Flatten gal took : 29 ms
[2023-03-11 05:46:04] [INFO ] Flatten gal took : 33 ms
[2023-03-11 05:46:04] [INFO ] Time to serialize gal into /tmp/LTL5615515394738355171.gal : 10 ms
[2023-03-11 05:46:04] [INFO ] Time to serialize properties into /tmp/LTL16097231132865869754.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/LTL5615515394738355171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16097231132865869754.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 : !((X(X(F((G(F("(p182!=1)")))||((("(p127==1)")&&(F("(p182!=1)")))&&(G(F("(p182==1)")))))))))
Formula 0 simplified : XXG(FG!"(p182!=1)" & (!"(p127==1)" | G!"(p182!=1)" | FG!"(p182==1)"))
Detected timeout of ITS tools.
[2023-03-11 05:46:19] [INFO ] Flatten gal took : 40 ms
[2023-03-11 05:46:19] [INFO ] Applying decomposition
[2023-03-11 05:46:19] [INFO ] Flatten gal took : 25 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/graph6539405181014694737.txt' '-o' '/tmp/graph6539405181014694737.bin' '-w' '/tmp/graph6539405181014694737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6539405181014694737.bin' '-l' '-1' '-v' '-w' '/tmp/graph6539405181014694737.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:46:19] [INFO ] Decomposing Gal with order
[2023-03-11 05:46:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:46:19] [INFO ] Removed a total of 70 redundant transitions.
[2023-03-11 05:46:19] [INFO ] Flatten gal took : 18 ms
[2023-03-11 05:46:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-11 05:46:19] [INFO ] Time to serialize gal into /tmp/LTL1741283872701606802.gal : 5 ms
[2023-03-11 05:46:19] [INFO ] Time to serialize properties into /tmp/LTL5393878432623807517.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/LTL1741283872701606802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5393878432623807517.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(i11.i0.u47.p182!=1)")))||((("(i6.i1.u37.p127==1)")&&(F("(i11.i0.u47.p182!=1)")))&&(G(F("(i11.i0.u47.p182==1)")))))))))
Formula 0 simplified : XXG(FG!"(i11.i0.u47.p182!=1)" & (!"(i6.i1.u37.p127==1)" | G!"(i11.i0.u47.p182!=1)" | FG!"(i11.i0.u47.p182==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7971504524058524007
[2023-03-11 05:46:34] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7971504524058524007
Running compilation step : cd /tmp/ltsmin7971504524058524007;'/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 567 ms.
Running link step : cd /tmp/ltsmin7971504524058524007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7971504524058524007;'/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' 'X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 98372 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' '!((!p0 U X((G(p1)&&F(p2)))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 377 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 377 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 376 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 376 transition count 364
Applied a total of 36 rules in 38 ms. Remains 376 /393 variables (removed 17) and now considering 364/383 (removed 19) transitions.
// Phase 1: matrix 364 rows 376 cols
[2023-03-11 05:46:49] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-11 05:46:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-11 05:46:50] [INFO ] Invariant cache hit.
[2023-03-11 05:46:50] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-11 05:46:50] [INFO ] Invariant cache hit.
[2023-03-11 05:46:50] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 364/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 376/393 places, 364/383 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s338 1) (EQ s107 1)), p1:(EQ s107 1), p2:(NEQ s338 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-12 finished in 1128 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((X(G(p0))&&(G(p0)||X(G(p1))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 382 transition count 371
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 377 transition count 366
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 377 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 376 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 376 transition count 365
Applied a total of 35 rules in 30 ms. Remains 376 /393 variables (removed 17) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 376 cols
[2023-03-11 05:46:51] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-11 05:46:51] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-11 05:46:51] [INFO ] Invariant cache hit.
[2023-03-11 05:46:51] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-11 05:46:51] [INFO ] Invariant cache hit.
[2023-03-11 05:46:51] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 365/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 376/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s302 0), p1:(EQ s107 0)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-13 finished in 893 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(X((F(G(p0))&&F(p1)))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 381 transition count 371
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 381 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 381 transition count 369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 376 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 376 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 375 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 375 transition count 363
Applied a total of 38 rules in 20 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-11 05:46:51] [INFO ] Computed 34 place invariants in 14 ms
[2023-03-11 05:46:52] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-11 05:46:52] [INFO ] Invariant cache hit.
[2023-03-11 05:46:52] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2023-03-11 05:46:52] [INFO ] Invariant cache hit.
[2023-03-11 05:46:52] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s208 1), p0:(EQ s17 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 741 reset in 228 ms.
Product exploration explored 100000 steps with 810 reset in 260 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Detected a total of 91/375 stabilizing places and 91/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 404 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 122 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 374 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-11 05:46:55] [INFO ] Invariant cache hit.
[2023-03-11 05:46:55] [INFO ] [Real]Absence check using 33 positive place invariants in 59 ms returned sat
[2023-03-11 05:46:55] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:46:56] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2023-03-11 05:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:46:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-11 05:46:56] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-11 05:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:46:56] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-11 05:46:56] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-11 05:46:58] [INFO ] Added : 278 causal constraints over 56 iterations in 2551 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Applied a total of 0 rules in 16 ms. Remains 375 /375 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2023-03-11 05:46:59] [INFO ] Invariant cache hit.
[2023-03-11 05:46:59] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-11 05:46:59] [INFO ] Invariant cache hit.
[2023-03-11 05:46:59] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-11 05:46:59] [INFO ] Invariant cache hit.
[2023-03-11 05:46:59] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 375/375 places, 363/363 transitions.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Detected a total of 91/375 stabilizing places and 91/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 116 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 298 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-11 05:47:01] [INFO ] Invariant cache hit.
[2023-03-11 05:47:01] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-11 05:47:01] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 05:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:47:01] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-11 05:47:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:47:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-11 05:47:02] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 05:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:47:02] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-11 05:47:02] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-11 05:47:05] [INFO ] Added : 278 causal constraints over 56 iterations in 2946 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 791 reset in 246 ms.
Product exploration explored 100000 steps with 815 reset in 230 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 375 transition count 363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 375 transition count 358
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 127 place count 375 transition count 358
Deduced a syphon composed of 173 places in 1 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 178 place count 375 transition count 358
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 277 place count 276 transition count 259
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 376 place count 276 transition count 259
Performed 86 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 462 place count 276 transition count 249
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 519 place count 219 transition count 192
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 576 place count 219 transition count 192
Deduced a syphon composed of 103 places in 0 ms
Applied a total of 576 rules in 55 ms. Remains 219 /375 variables (removed 156) and now considering 192/363 (removed 171) transitions.
[2023-03-11 05:47:06] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 192 rows 219 cols
[2023-03-11 05:47:06] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-11 05:47:06] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/375 places, 192/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 219/375 places, 192/363 transitions.
Built C files in :
/tmp/ltsmin3173825558242122844
[2023-03-11 05:47:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3173825558242122844
Running compilation step : cd /tmp/ltsmin3173825558242122844;'/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 541 ms.
Running link step : cd /tmp/ltsmin3173825558242122844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin3173825558242122844;'/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' '--hoa' '/tmp/stateBased9587486199395255447.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Applied a total of 0 rules in 11 ms. Remains 375 /375 variables (removed 0) and now considering 363/363 (removed 0) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-11 05:47:22] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-11 05:47:22] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-11 05:47:22] [INFO ] Invariant cache hit.
[2023-03-11 05:47:22] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-11 05:47:22] [INFO ] Invariant cache hit.
[2023-03-11 05:47:22] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 375/375 places, 363/363 transitions.
Built C files in :
/tmp/ltsmin4293781900360636660
[2023-03-11 05:47:22] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4293781900360636660
Running compilation step : cd /tmp/ltsmin4293781900360636660;'/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 508 ms.
Running link step : cd /tmp/ltsmin4293781900360636660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin4293781900360636660;'/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' '--hoa' '/tmp/stateBased7121244188388991112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:47:37] [INFO ] Flatten gal took : 15 ms
[2023-03-11 05:47:37] [INFO ] Flatten gal took : 14 ms
[2023-03-11 05:47:37] [INFO ] Time to serialize gal into /tmp/LTL17294729868453827934.gal : 3 ms
[2023-03-11 05:47:37] [INFO ] Time to serialize properties into /tmp/LTL5530377978093281969.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/LTL17294729868453827934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut99406251344645755.hoa' '-atoms' '/tmp/LTL5530377978093281969.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...316
Loading property file /tmp/LTL5530377978093281969.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut99406251344645755.hoa
Detected timeout of ITS tools.
[2023-03-11 05:47:52] [INFO ] Flatten gal took : 9 ms
[2023-03-11 05:47:53] [INFO ] Flatten gal took : 8 ms
[2023-03-11 05:47:53] [INFO ] Time to serialize gal into /tmp/LTL7951319419613821669.gal : 2 ms
[2023-03-11 05:47:53] [INFO ] Time to serialize properties into /tmp/LTL9596457654012658875.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/LTL7951319419613821669.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9596457654012658875.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 : !((X(X((F(G("(p17==0)")))&&(F("(p308==1)"))))))
Formula 0 simplified : XX(GF!"(p17==0)" | G!"(p308==1)")
Detected timeout of ITS tools.
[2023-03-11 05:48:08] [INFO ] Flatten gal took : 25 ms
[2023-03-11 05:48:08] [INFO ] Applying decomposition
[2023-03-11 05:48:08] [INFO ] Flatten gal took : 27 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/graph15592366870086387333.txt' '-o' '/tmp/graph15592366870086387333.bin' '-w' '/tmp/graph15592366870086387333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15592366870086387333.bin' '-l' '-1' '-v' '-w' '/tmp/graph15592366870086387333.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:48:08] [INFO ] Decomposing Gal with order
[2023-03-11 05:48:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:48:08] [INFO ] Removed a total of 69 redundant transitions.
[2023-03-11 05:48:08] [INFO ] Flatten gal took : 30 ms
[2023-03-11 05:48:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-11 05:48:08] [INFO ] Time to serialize gal into /tmp/LTL16163906395437801946.gal : 4 ms
[2023-03-11 05:48:08] [INFO ] Time to serialize properties into /tmp/LTL10022151746981184415.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/LTL16163906395437801946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10022151746981184415.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 : !((X(X((F(G("(i8.i0.u6.p17==0)")))&&(F("(i22.i0.u83.p308==1)"))))))
Formula 0 simplified : XX(GF!"(i8.i0.u6.p17==0)" | G!"(i22.i0.u83.p308==1)")
Reverse transition relation is NOT exact ! Due to transitions t131, t134, t144, t147, t157, t160, t193, t200, t252, t274, t291, t370, t371, t372, t374, t37...925
Computing Next relation with stutter on 800 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7449476613061946907
[2023-03-11 05:48:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7449476613061946907
Running compilation step : cd /tmp/ltsmin7449476613061946907;'/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 532 ms.
Running link step : cd /tmp/ltsmin7449476613061946907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin7449476613061946907;'/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' 'X(X((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 106609 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(F((p0||(p1 U G(p2))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 392 transition count 250
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 150 rules applied. Total rules applied 282 place count 260 transition count 232
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 293 place count 250 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 249 transition count 231
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 294 place count 249 transition count 182
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 392 place count 200 transition count 182
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 400 place count 192 transition count 174
Iterating global reduction 4 with 8 rules applied. Total rules applied 408 place count 192 transition count 174
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 408 place count 192 transition count 171
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 414 place count 189 transition count 171
Performed 72 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 558 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 559 place count 116 transition count 89
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 570 place count 108 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 573 place count 105 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 573 place count 105 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 581 place count 101 transition count 82
Applied a total of 581 rules in 37 ms. Remains 101 /393 variables (removed 292) and now considering 82/383 (removed 301) transitions.
// Phase 1: matrix 82 rows 101 cols
[2023-03-11 05:48:38] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-11 05:48:38] [INFO ] Implicit Places using invariants in 119 ms returned [42, 59, 76, 82, 86, 90, 94, 100]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 120 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/393 places, 82/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 87 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 86 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 84 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 83 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 83 transition count 72
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 22 place count 82 transition count 71
Applied a total of 22 rules in 8 ms. Remains 82 /93 variables (removed 11) and now considering 71/82 (removed 11) transitions.
// Phase 1: matrix 71 rows 82 cols
[2023-03-11 05:48:38] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-11 05:48:38] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 05:48:38] [INFO ] Invariant cache hit.
[2023-03-11 05:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:38] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/393 places, 71/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 396 ms. Remains : 82/393 places, 71/383 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s35 1), p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1000 steps with 82 reset in 4 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-15 finished in 570 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(((G(p0)||(X(p1)&&F(!p0))) U p2)))'
Found a Lengthening insensitive property : AutoFlight-PT-05b-LTLFireability-07
Stuttering acceptance computed with spot in 336 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 392 transition count 248
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 152 rules applied. Total rules applied 286 place count 258 transition count 230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 296 place count 248 transition count 230
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 296 place count 248 transition count 183
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 390 place count 201 transition count 183
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 398 place count 193 transition count 175
Iterating global reduction 3 with 8 rules applied. Total rules applied 406 place count 193 transition count 175
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 406 place count 193 transition count 171
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 414 place count 189 transition count 171
Performed 71 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 556 place count 118 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 557 place count 117 transition count 90
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 567 place count 109 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 569 place count 107 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 569 place count 107 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 579 place count 102 transition count 83
Applied a total of 579 rules in 60 ms. Remains 102 /393 variables (removed 291) and now considering 83/383 (removed 300) transitions.
// Phase 1: matrix 83 rows 102 cols
[2023-03-11 05:48:39] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-11 05:48:39] [INFO ] Implicit Places using invariants in 105 ms returned [42, 59, 76, 81, 87, 91, 95, 101]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 106 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 94/393 places, 83/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 88 transition count 77
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 88 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 87 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 86 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 85 transition count 74
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 20 place count 84 transition count 73
Applied a total of 20 rules in 4 ms. Remains 84 /94 variables (removed 10) and now considering 73/83 (removed 10) transitions.
// Phase 1: matrix 73 rows 84 cols
[2023-03-11 05:48:39] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-11 05:48:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 05:48:39] [INFO ] Invariant cache hit.
[2023-03-11 05:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:39] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 84/393 places, 73/383 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 368 ms. Remains : 84/393 places, 73/383 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s27 1), p0:(EQ s39 1), p1:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4195 reset in 163 ms.
Product exploration explored 100000 steps with 4220 reset in 248 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 1043 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 427 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:48:41] [INFO ] Invariant cache hit.
[2023-03-11 05:48:42] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-11 05:48:42] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 05:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:42] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:48:42] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:48:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-11 05:48:42] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:48:42] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 05:48:42] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 05:48:42] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 73/73 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 82 transition count 71
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 31 place count 82 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t282.t276.t311.t277.t275.t31.t115.t372.t32 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 31 edges and 40 vertex of which 3 / 40 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 23 rules applied. Total rules applied 54 place count 38 transition count 22
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 78 place count 18 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 78 place count 18 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 16 transition count 16
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 14 transition count 14
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 14 transition count 14
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 4 with 2 rules applied. Total rules applied 88 place count 13 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 19 edges and 13 vertex of which 11 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 11 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 93 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 95 place count 9 transition count 9
Applied a total of 95 rules in 39 ms. Remains 9 /84 variables (removed 75) and now considering 9/73 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 9/84 places, 9/73 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 878 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 73/73 transitions.
Applied a total of 0 rules in 0 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-11 05:48:43] [INFO ] Invariant cache hit.
[2023-03-11 05:48:44] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-11 05:48:44] [INFO ] Invariant cache hit.
[2023-03-11 05:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-11 05:48:44] [INFO ] Invariant cache hit.
[2023-03-11 05:48:44] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 84/84 places, 73/73 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 972 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 417 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:48:45] [INFO ] Invariant cache hit.
[2023-03-11 05:48:45] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2023-03-11 05:48:46] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 05:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:46] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:48:46] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:48:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-11 05:48:46] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:48:46] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 05:48:46] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 05:48:46] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 73/73 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 82 transition count 71
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 31 place count 82 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t282.t276.t311.t277.t275.t31.t115.t372.t32 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 31 edges and 40 vertex of which 3 / 40 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 23 rules applied. Total rules applied 54 place count 38 transition count 22
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 78 place count 18 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 78 place count 18 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 16 transition count 16
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 14 transition count 14
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 14 transition count 14
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 4 with 2 rules applied. Total rules applied 88 place count 13 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 19 edges and 13 vertex of which 11 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 11 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 93 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 95 place count 9 transition count 9
Applied a total of 95 rules in 7 ms. Remains 9 /84 variables (removed 75) and now considering 9/73 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 9/84 places, 9/73 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 1229 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 415 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Product exploration explored 100000 steps with 4189 reset in 145 ms.
Product exploration explored 100000 steps with 4206 reset in 203 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-11 05:48:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 05:48:49] [INFO ] Invariant cache hit.
[2023-03-11 05:48:49] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 84/84 places, 73/73 transitions.
Built C files in :
/tmp/ltsmin16458009192088873650
[2023-03-11 05:48:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16458009192088873650
Running compilation step : cd /tmp/ltsmin16458009192088873650;'/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 156 ms.
Running link step : cd /tmp/ltsmin16458009192088873650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16458009192088873650;'/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' '--hoa' '/tmp/stateBased17909047422684583554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-11 05:49:04] [INFO ] Invariant cache hit.
[2023-03-11 05:49:04] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-11 05:49:04] [INFO ] Invariant cache hit.
[2023-03-11 05:49:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:49:04] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-11 05:49:04] [INFO ] Invariant cache hit.
[2023-03-11 05:49:05] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 84/84 places, 73/73 transitions.
Built C files in :
/tmp/ltsmin12746078007750216527
[2023-03-11 05:49:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12746078007750216527
Running compilation step : cd /tmp/ltsmin12746078007750216527;'/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 200 ms.
Running link step : cd /tmp/ltsmin12746078007750216527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12746078007750216527;'/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' '--hoa' '/tmp/stateBased5117119611718758186.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:49:20] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:49:20] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:49:20] [INFO ] Time to serialize gal into /tmp/LTL15764060671314951859.gal : 1 ms
[2023-03-11 05:49:20] [INFO ] Time to serialize properties into /tmp/LTL11589467844917447686.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/LTL15764060671314951859.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8796766571381816457.hoa' '-atoms' '/tmp/LTL11589467844917447686.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/LTL11589467844917447686.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8796766571381816457.hoa
Reverse transition relation is NOT exact ! Due to transitions t214, t206.t202.t350.t203.t201.t31.t115.t372.t32, Intersection with reachable at each step e...209
Computing Next relation with stutter on 1344 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.106744,19024,1,0,150,23714,180,71,2432,20827,180
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property AutoFlight-PT-05b-LTLFireability-07 finished in 41315 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(X(F((G(F(p0))||(p1&&F(p0)&&G(F(!p0))))))))'
Found a Shortening insensitive property : AutoFlight-PT-05b-LTLFireability-09
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 392 transition count 246
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 154 rules applied. Total rules applied 290 place count 256 transition count 228
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 300 place count 246 transition count 228
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 300 place count 246 transition count 180
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 396 place count 198 transition count 180
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 404 place count 190 transition count 172
Iterating global reduction 3 with 8 rules applied. Total rules applied 412 place count 190 transition count 172
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 412 place count 190 transition count 168
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 420 place count 186 transition count 168
Performed 69 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 558 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 116 transition count 89
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 572 place count 107 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 576 place count 103 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 576 place count 103 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 586 place count 98 transition count 80
Applied a total of 586 rules in 27 ms. Remains 98 /393 variables (removed 295) and now considering 80/383 (removed 303) transitions.
// Phase 1: matrix 80 rows 98 cols
[2023-03-11 05:49:20] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-11 05:49:20] [INFO ] Implicit Places using invariants in 124 ms returned [41, 58, 75, 79, 83, 87, 91, 97]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 124 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 90/393 places, 80/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 84 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 84 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 69
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 24 place count 78 transition count 68
Applied a total of 24 rules in 16 ms. Remains 78 /90 variables (removed 12) and now considering 68/80 (removed 12) transitions.
// Phase 1: matrix 68 rows 78 cols
[2023-03-11 05:49:20] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 05:49:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 05:49:20] [INFO ] Invariant cache hit.
[2023-03-11 05:49:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-11 05:49:21] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 78/393 places, 68/383 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 435 ms. Remains : 78/393 places, 68/383 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s19 1), p0:(NEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11979 reset in 135 ms.
Stack based approach found an accepted trace after 3313 steps with 394 reset with depth 12 and stack size 12 in 5 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 912 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' '!(X(X((F(G(p0))&&F(p1)))))'
Found a Shortening insensitive property : AutoFlight-PT-05b-LTLFireability-14
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 392 transition count 245
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 155 rules applied. Total rules applied 292 place count 255 transition count 227
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 302 place count 245 transition count 227
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 302 place count 245 transition count 179
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 398 place count 197 transition count 179
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 407 place count 188 transition count 170
Iterating global reduction 3 with 9 rules applied. Total rules applied 416 place count 188 transition count 170
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 416 place count 188 transition count 166
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 424 place count 184 transition count 166
Performed 67 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 558 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 116 transition count 89
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 572 place count 107 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 576 place count 103 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 576 place count 103 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 586 place count 98 transition count 80
Applied a total of 586 rules in 34 ms. Remains 98 /393 variables (removed 295) and now considering 80/383 (removed 303) transitions.
// Phase 1: matrix 80 rows 98 cols
[2023-03-11 05:49:21] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-11 05:49:21] [INFO ] Implicit Places using invariants in 112 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 97/393 places, 80/383 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 90 transition count 73
Applied a total of 14 rules in 3 ms. Remains 90 /97 variables (removed 7) and now considering 73/80 (removed 7) transitions.
// Phase 1: matrix 73 rows 90 cols
[2023-03-11 05:49:21] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-11 05:49:21] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 05:49:21] [INFO ] Invariant cache hit.
[2023-03-11 05:49:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 05:49:22] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/393 places, 73/383 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 411 ms. Remains : 90/393 places, 73/383 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s40 1), p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2787 steps with 138 reset in 4 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 819 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-11 05:49:22] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4291567207357618432
[2023-03-11 05:49:22] [INFO ] Computing symmetric may disable matrix : 383 transitions.
[2023-03-11 05:49:22] [INFO ] Applying decomposition
[2023-03-11 05:49:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:49:22] [INFO ] Computing symmetric may enable matrix : 383 transitions.
[2023-03-11 05:49:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:49:22] [INFO ] Flatten gal took : 10 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/graph684176096241187241.txt' '-o' '/tmp/graph684176096241187241.bin' '-w' '/tmp/graph684176096241187241.weights'
[2023-03-11 05:49:22] [INFO ] Computing Do-Not-Accords matrix : 383 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph684176096241187241.bin' '-l' '-1' '-v' '-w' '/tmp/graph684176096241187241.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:49:22] [INFO ] Decomposing Gal with order
[2023-03-11 05:49:22] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:49:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:49:22] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4291567207357618432
Running compilation step : cd /tmp/ltsmin4291567207357618432;'/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 05:49:22] [INFO ] Removed a total of 62 redundant transitions.
[2023-03-11 05:49:22] [INFO ] Flatten gal took : 17 ms
[2023-03-11 05:49:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 05:49:22] [INFO ] Time to serialize gal into /tmp/LTLFireability5365642645303658050.gal : 3 ms
[2023-03-11 05:49:22] [INFO ] Time to serialize properties into /tmp/LTLFireability8312048365463941578.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/LTLFireability5365642645303658050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8312048365463941578.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...276
Read 2 LTL properties
Checking formula 0 : !((X(X(F((G(F("(i10.u46.p182!=1)")))||((("(i9.u39.p127==1)")&&(F("(i10.u46.p182!=1)")))&&(G(F("(i10.u46.p182==1)")))))))))
Formula 0 simplified : XXG(FG!"(i10.u46.p182!=1)" & (!"(i9.u39.p127==1)" | G!"(i10.u46.p182!=1)" | FG!"(i10.u46.p182==1)"))
Compilation finished in 697 ms.
Running link step : cd /tmp/ltsmin4291567207357618432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4291567207357618432;'/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' 'X(X(<>(([](<>((LTLAPp3==true)))||((LTLAPp4==true)&&<>((LTLAPp3==true))&&[](<>(!(LTLAPp3==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t131, t134, t157, t173, t193, t218, t227, t252, t274, t291, t370, t371, t372, t374, t375, i0....1010
Computing Next relation with stutter on 800 deadlock states
186 unique states visited
186 strongly connected components in search stack
187 transitions explored
186 items max in DFS search stack
23754 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,237.585,2754504,1,0,6.78057e+06,440,2654,9.68933e+06,144,1757,1090309
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-05b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X((F(G("(i1.u7.p17==0)")))&&(F("(i20.u89.p308==1)"))))))
Formula 1 simplified : XX(GF!"(i1.u7.p17==0)" | G!"(i20.u89.p308==1)")
Computing Next relation with stutter on 800 deadlock states
Detected timeout of ITS tools.
[2023-03-11 06:11:25] [INFO ] Applying decomposition
[2023-03-11 06:11:25] [INFO ] Flatten gal took : 20 ms
[2023-03-11 06:11:25] [INFO ] Decomposing Gal with order
[2023-03-11 06:11:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:11:25] [INFO ] Removed a total of 12 redundant transitions.
[2023-03-11 06:11:25] [INFO ] Flatten gal took : 44 ms
[2023-03-11 06:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 66 ms.
[2023-03-11 06:11:25] [INFO ] Time to serialize gal into /tmp/LTLFireability1711005834172881344.gal : 6 ms
[2023-03-11 06:11:25] [INFO ] Time to serialize properties into /tmp/LTLFireability16933626488422825525.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/LTLFireability1711005834172881344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16933626488422825525.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 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p17==0)")))&&(F("(i1.i0.u65.p308==1)"))))))
Formula 0 simplified : XX(GF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p17==0)" | G!"(i1.i0.u65.p308==1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: LTL layer: formula: X(X(<>(([](<>((LTLAPp3==true)))||((LTLAPp4==true)&&<>((LTLAPp3==true))&&[](<>(!(LTLAPp3==true))))))))
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.042: "X(X(<>(([](<>((LTLAPp3==true)))||((LTLAPp4==true)&&<>((LTLAPp3==true))&&[](<>(!(LTLAPp3==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.043: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.097: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.202: DFS-FIFO for weak LTL, using special progress label 391
pins2lts-mc-linux64( 0/ 8), 0.202: There are 392 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.202: State length is 394, there are 388 groups
pins2lts-mc-linux64( 0/ 8), 0.202: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.202: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.202: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.202: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.247: ~1 levels ~960 states ~4408 transitions
pins2lts-mc-linux64( 6/ 8), 0.288: ~1 levels ~1920 states ~10120 transitions
pins2lts-mc-linux64( 6/ 8), 0.361: ~1 levels ~3840 states ~23272 transitions
pins2lts-mc-linux64( 7/ 8), 0.460: ~1 levels ~7680 states ~49320 transitions
pins2lts-mc-linux64( 7/ 8), 0.727: ~1 levels ~15360 states ~115408 transitions
pins2lts-mc-linux64( 7/ 8), 1.171: ~1 levels ~30720 states ~237752 transitions
pins2lts-mc-linux64( 0/ 8), 2.014: ~1 levels ~61440 states ~552016 transitions
pins2lts-mc-linux64( 4/ 8), 3.071: ~237 levels ~122880 states ~856232 transitions
pins2lts-mc-linux64( 4/ 8), 4.513: ~237 levels ~245760 states ~1199256 transitions
pins2lts-mc-linux64( 2/ 8), 7.228: ~218 levels ~491520 states ~2105336 transitions
pins2lts-mc-linux64( 2/ 8), 11.649: ~219 levels ~983040 states ~3554912 transitions
pins2lts-mc-linux64( 2/ 8), 20.693: ~219 levels ~1966080 states ~6710032 transitions
pins2lts-mc-linux64( 2/ 8), 38.841: ~219 levels ~3932160 states ~13723832 transitions
pins2lts-mc-linux64( 2/ 8), 76.081: ~219 levels ~7864320 states ~28864744 transitions
pins2lts-mc-linux64( 2/ 8), 152.429: ~219 levels ~15728640 states ~61019736 transitions
pins2lts-mc-linux64( 2/ 8), 303.475: ~219 levels ~31457280 states ~124763600 transitions
pins2lts-mc-linux64( 2/ 8), 614.049: ~219 levels ~62914560 states ~262654856 transitions
pins2lts-mc-linux64( 2/ 8), 1228.327: ~219 levels ~125829120 states ~527430248 transitions
pins2lts-mc-linux64( 4/ 8), 1689.669: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1689.722:
pins2lts-mc-linux64( 0/ 8), 1689.722: mean standard work distribution: 18.8% (states) 16.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1689.722:
pins2lts-mc-linux64( 0/ 8), 1689.722: Explored 129486658 states 593964977 transitions, fanout: 4.587
pins2lts-mc-linux64( 0/ 8), 1689.722: Total exploration time 1689.500 sec (1689.460 sec minimum, 1689.475 sec on average)
pins2lts-mc-linux64( 0/ 8), 1689.722: States per second: 76642, Transitions per second: 351563
pins2lts-mc-linux64( 0/ 8), 1689.722:
pins2lts-mc-linux64( 0/ 8), 1689.722: Progress states detected: 9150912
pins2lts-mc-linux64( 0/ 8), 1689.722: Redundant explorations: -3.5247
pins2lts-mc-linux64( 0/ 8), 1689.722:
pins2lts-mc-linux64( 0/ 8), 1689.722: Queue width: 8B, total height: 8792282, memory: 67.08MB
pins2lts-mc-linux64( 0/ 8), 1689.722: Tree memory: 1074.2MB, 8.4 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1689.722: Tree fill ratio (roots/leafs): 99.0%/19.0%
pins2lts-mc-linux64( 0/ 8), 1689.722: Stored 385 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1689.722: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1689.722: Est. total memory use: 1141.3MB (~1091.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4291567207357618432;'/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' 'X(X(<>(([](<>((LTLAPp3==true)))||((LTLAPp4==true)&&<>((LTLAPp3==true))&&[](<>(!(LTLAPp3==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4291567207357618432;'/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' 'X(X(<>(([](<>((LTLAPp3==true)))||((LTLAPp4==true)&&<>((LTLAPp3==true))&&[](<>(!(LTLAPp3==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-11 06:33:32] [INFO ] Flatten gal took : 343 ms
[2023-03-11 06:33:33] [INFO ] Input system was already deterministic with 383 transitions.
[2023-03-11 06:33:34] [INFO ] Transformed 393 places.
[2023-03-11 06:33:34] [INFO ] Transformed 383 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 06:33:34] [INFO ] Time to serialize gal into /tmp/LTLFireability1084964950683110406.gal : 5 ms
[2023-03-11 06:33:34] [INFO ] Time to serialize properties into /tmp/LTLFireability678343370706277431.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1084964950683110406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability678343370706277431.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...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((F(G("(p17==0)")))&&(F("(p308==1)"))))))
Formula 0 simplified : XX(GF!"(p17==0)" | G!"(p308==1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6584936 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16046732 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-05b"
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-05b, 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-167813593100444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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