Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r003-smll-171620117300268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AirplaneLD-PT-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117300268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 76K Apr 12 03:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 286K Apr 12 03:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K Apr 12 03:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 181K Apr 12 03:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 704K Apr 12 03:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108K Apr 12 03:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 646K Apr 12 03:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 433K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716419324340

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:08:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:08:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:08:47] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2024-05-22 23:08:47] [INFO ] Transformed 719 places.
[2024-05-22 23:08:47] [INFO ] Transformed 808 transitions.
[2024-05-22 23:08:47] [INFO ] Found NUPN structural information;
[2024-05-22 23:08:47] [INFO ] Parsed PT model containing 719 places and 808 transitions and 3078 arcs in 702 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 302 places and 0 transitions.
Support contains 313 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 808/808 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 414 transition count 808
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 102 place count 315 transition count 709
Iterating global reduction 1 with 99 rules applied. Total rules applied 201 place count 315 transition count 709
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 300 place count 315 transition count 610
Applied a total of 300 rules in 96 ms. Remains 315 /417 variables (removed 102) and now considering 610/808 (removed 198) transitions.
// Phase 1: matrix 610 rows 315 cols
[2024-05-22 23:08:48] [INFO ] Computed 1 invariants in 134 ms
[2024-05-22 23:08:48] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-05-22 23:08:48] [INFO ] Invariant cache hit.
[2024-05-22 23:08:49] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-05-22 23:08:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 610/921 variables, 311/312 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 4/925 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 925/925 variables, and 316 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30053 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 610/921 variables, 311/312 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 305/617 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/921 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 4/925 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 621 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints]
After SMT, in 61337ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 61382ms
Starting structural reductions in LTL mode, iteration 1 : 315/417 places, 610/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62721 ms. Remains : 315/417 places, 610/808 transitions.
Support contains 313 out of 315 places after structural reductions.
[2024-05-22 23:09:51] [INFO ] Flatten gal took : 125 ms
[2024-05-22 23:09:51] [INFO ] Flatten gal took : 73 ms
[2024-05-22 23:09:51] [INFO ] Input system was already deterministic with 610 transitions.
RANDOM walk for 40000 steps (5157 resets) in 3744 ms. (10 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40004 steps (60 resets) in 791 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 63 ms. (625 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
[2024-05-22 23:09:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 302/404 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 3 (OVERLAPS) 307/711 variables, 105/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/711 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/915 variables, 102/309 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/922 variables, 4/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/924 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/924 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/925 variables, 2/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/925 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/925 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 316 constraints, problems are : Problem set: 1 solved, 1 unsolved in 510 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/154 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 353/507 variables, 152/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 204/711 variables, 53/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/711 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 204/915 variables, 102/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/922 variables, 4/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/922 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/924 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/924 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/925 variables, 2/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/925 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/925 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 317 constraints, problems are : Problem set: 1 solved, 1 unsolved in 495 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1131ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Computed a total of 315 stabilizing places and 610 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 315 transition count 610
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U !p1))))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 16 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 23:09:54] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:09:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 23:09:54] [INFO ] Invariant cache hit.
[2024-05-22 23:09:54] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-22 23:09:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 211 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 9 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 410ms
Starting structural reductions in LTL mode, iteration 1 : 19/315 places, 18/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 19/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 482 ms :[p1, (OR (NOT p0) p1), p1, p1, true]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 474 ms.
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-00 finished in 1906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(p1)))))'
Support contains 53 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 245 places :
Symmetric choice reduction at 0 with 245 rule applications. Total rules 245 place count 70 transition count 365
Iterating global reduction 0 with 245 rules applied. Total rules applied 490 place count 70 transition count 365
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 735 place count 70 transition count 120
Applied a total of 735 rules in 8 ms. Remains 70 /315 variables (removed 245) and now considering 120/610 (removed 490) transitions.
// Phase 1: matrix 120 rows 70 cols
[2024-05-22 23:09:56] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 23:09:56] [INFO ] Implicit Places using invariants in 39 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/315 places, 120/610 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 69/315 places, 120/610 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-01
Entered a terminal (fully accepting) state of product in 93 steps with 10 reset in 7 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-01 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 102 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 111 are kept as prefixes of interest. Removing 204 places using SCC suffix rule.3 ms
Discarding 204 places :
Also discarding 400 output transitions
Drop transitions (Output transitions of discarded places.) removed 400 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 110 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 110 transition count 208
Applied a total of 4 rules in 22 ms. Remains 110 /315 variables (removed 205) and now considering 208/610 (removed 402) transitions.
// Phase 1: matrix 208 rows 110 cols
[2024-05-22 23:09:56] [INFO ] Computed 1 invariants in 5 ms
[2024-05-22 23:09:56] [INFO ] Implicit Places using invariants in 42 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/315 places, 208/610 transitions.
Graph (complete) has 107 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 6 ms. Remains 108 /109 variables (removed 1) and now considering 207/208 (removed 1) transitions.
// Phase 1: matrix 207 rows 108 cols
[2024-05-22 23:09:56] [INFO ] Computed 0 invariants in 4 ms
[2024-05-22 23:09:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:09:56] [INFO ] Invariant cache hit.
[2024-05-22 23:09:57] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/315 places, 207/610 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 108/315 places, 207/610 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-02
Product exploration explored 100000 steps with 19002 reset in 1216 ms.
Product exploration explored 100000 steps with 19071 reset in 834 ms.
Computed a total of 108 stabilizing places and 207 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 207
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 71 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-02 finished in 2594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 53 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 245 places :
Symmetric choice reduction at 0 with 245 rule applications. Total rules 245 place count 70 transition count 365
Iterating global reduction 0 with 245 rules applied. Total rules applied 490 place count 70 transition count 365
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 735 place count 70 transition count 120
Applied a total of 735 rules in 24 ms. Remains 70 /315 variables (removed 245) and now considering 120/610 (removed 490) transitions.
// Phase 1: matrix 120 rows 70 cols
[2024-05-22 23:09:59] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 23:09:59] [INFO ] Implicit Places using invariants in 57 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/315 places, 120/610 transitions.
Graph (complete) has 67 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 67 transition count 118
Applied a total of 3 rules in 9 ms. Remains 67 /69 variables (removed 2) and now considering 118/120 (removed 2) transitions.
// Phase 1: matrix 118 rows 67 cols
[2024-05-22 23:09:59] [INFO ] Computed 0 invariants in 2 ms
[2024-05-22 23:09:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:09:59] [INFO ] Invariant cache hit.
[2024-05-22 23:09:59] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/315 places, 118/610 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 67/315 places, 118/610 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-03
Product exploration explored 100000 steps with 14387 reset in 557 ms.
Product exploration explored 100000 steps with 14426 reset in 589 ms.
Computed a total of 67 stabilizing places and 118 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 118
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-03 finished in 1569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(G(p1))))))'
Support contains 54 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 213 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.2 ms
Discarding 102 places :
Also discarding 200 output transitions
Drop transitions (Output transitions of discarded places.) removed 200 transitions
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 148 place count 66 transition count 263
Iterating global reduction 0 with 147 rules applied. Total rules applied 295 place count 66 transition count 263
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Iterating post reduction 0 with 147 rules applied. Total rules applied 442 place count 66 transition count 116
Applied a total of 442 rules in 10 ms. Remains 66 /315 variables (removed 249) and now considering 116/610 (removed 494) transitions.
// Phase 1: matrix 116 rows 66 cols
[2024-05-22 23:10:00] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 23:10:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 23:10:01] [INFO ] Invariant cache hit.
[2024-05-22 23:10:01] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-22 23:10:01] [INFO ] Redundant transitions in 3 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-22 23:10:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 116/179 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 3/182 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 67 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1361 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 116/179 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 3/182 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 125 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2117 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 3531ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3532ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/315 places, 116/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3643 ms. Remains : 66/315 places, 116/610 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-04
Product exploration explored 100000 steps with 18384 reset in 569 ms.
Product exploration explored 100000 steps with 18263 reset in 585 ms.
Computed a total of 66 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-04 finished in 5331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((p1&&X(p1))))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 7 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 23:10:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:10:06] [INFO ] Implicit Places using invariants in 30 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/315 places, 18/610 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 18/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-05 finished in 486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 11 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
[2024-05-22 23:10:06] [INFO ] Invariant cache hit.
[2024-05-22 23:10:06] [INFO ] Implicit Places using invariants in 43 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/315 places, 18/610 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 18/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-06
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-06 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&G(p1)))))))'
Support contains 51 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 67 transition count 362
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 67 transition count 362
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 67 transition count 114
Applied a total of 744 rules in 9 ms. Remains 67 /315 variables (removed 248) and now considering 114/610 (removed 496) transitions.
// Phase 1: matrix 114 rows 67 cols
[2024-05-22 23:10:06] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 23:10:07] [INFO ] Implicit Places using invariants in 55 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/315 places, 114/610 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 66/315 places, 114/610 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-07 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(p1)))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 9 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 23:10:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:10:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:10:07] [INFO ] Invariant cache hit.
[2024-05-22 23:10:07] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-22 23:10:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 210 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 9 unsolved in 206 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 422ms
Starting structural reductions in LTL mode, iteration 1 : 19/315 places, 18/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 19/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-08
Product exploration explored 100000 steps with 42933 reset in 230 ms.
Product exploration explored 100000 steps with 42889 reset in 319 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-08 finished in 1452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 294 places :
Symmetric choice reduction at 0 with 294 rule applications. Total rules 294 place count 21 transition count 316
Iterating global reduction 0 with 294 rules applied. Total rules applied 588 place count 21 transition count 316
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Iterating post reduction 0 with 294 rules applied. Total rules applied 882 place count 21 transition count 22
Applied a total of 882 rules in 9 ms. Remains 21 /315 variables (removed 294) and now considering 22/610 (removed 588) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-22 23:10:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:10:08] [INFO ] Implicit Places using invariants in 49 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/315 places, 22/610 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 20/315 places, 22/610 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-09
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-09 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 1 are kept as prefixes of interest. Removing 314 places using SCC suffix rule.2 ms
Discarding 314 places :
Also discarding 510 output transitions
Drop transitions (Output transitions of discarded places.) removed 510 transitions
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 1 transition count 1
Applied a total of 100 rules in 4 ms. Remains 1 /315 variables (removed 314) and now considering 1/610 (removed 609) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-22 23:10:09] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:10:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 23:10:09] [INFO ] Invariant cache hit.
[2024-05-22 23:10:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-22 23:10:09] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1/315 places, 1/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 1/315 places, 1/610 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-10 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 8 are kept as prefixes of interest. Removing 307 places using SCC suffix rule.2 ms
Discarding 307 places :
Also discarding 602 output transitions
Drop transitions (Output transitions of discarded places.) removed 602 transitions
Applied a total of 1 rules in 5 ms. Remains 8 /315 variables (removed 307) and now considering 8/610 (removed 602) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-22 23:10:09] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:10:09] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 23:10:09] [INFO ] Invariant cache hit.
[2024-05-22 23:10:09] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-22 23:10:09] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-22 23:10:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 98 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 87 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/315 places, 8/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 8/315 places, 8/610 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-11 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(F(p1))))||(!p0 U (p2||G(!p0)))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 9 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 23:10:09] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:10:09] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 23:10:09] [INFO ] Invariant cache hit.
[2024-05-22 23:10:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-22 23:10:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 208 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 9 unsolved in 214 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 426ms
Starting structural reductions in LTL mode, iteration 1 : 19/315 places, 18/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 19/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, false, (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-12
Product exploration explored 100000 steps with 44987 reset in 154 ms.
Product exploration explored 100000 steps with 44993 reset in 181 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-12 finished in 1249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 295 places :
Symmetric choice reduction at 0 with 295 rule applications. Total rules 295 place count 20 transition count 315
Iterating global reduction 0 with 295 rules applied. Total rules applied 590 place count 20 transition count 315
Ensure Unique test removed 295 transitions
Reduce isomorphic transitions removed 295 transitions.
Iterating post reduction 0 with 295 rules applied. Total rules applied 885 place count 20 transition count 20
Applied a total of 885 rules in 6 ms. Remains 20 /315 variables (removed 295) and now considering 20/610 (removed 590) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-22 23:10:11] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:10:11] [INFO ] Implicit Places using invariants in 49 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/315 places, 20/610 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 19/315 places, 20/610 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-13
Entered a terminal (fully accepting) state of product in 146 steps with 18 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-13 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 4 are kept as prefixes of interest. Removing 311 places using SCC suffix rule.2 ms
Discarding 311 places :
Also discarding 606 output transitions
Drop transitions (Output transitions of discarded places.) removed 606 transitions
Applied a total of 1 rules in 4 ms. Remains 4 /315 variables (removed 311) and now considering 4/610 (removed 606) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 23:10:11] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:10:11] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 23:10:11] [INFO ] Invariant cache hit.
[2024-05-22 23:10:11] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-22 23:10:11] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-22 23:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 42 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 47 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 93ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/315 places, 4/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 4/315 places, 4/610 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-14
Product exploration explored 100000 steps with 39933 reset in 98 ms.
Product exploration explored 100000 steps with 39974 reset in 102 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-14 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1 U (F(p2)||X(G(p3)))))))'
Support contains 8 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 293 places :
Symmetric choice reduction at 0 with 293 rule applications. Total rules 293 place count 22 transition count 317
Iterating global reduction 0 with 293 rules applied. Total rules applied 586 place count 22 transition count 317
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 879 place count 22 transition count 24
Applied a total of 879 rules in 4 ms. Remains 22 /315 variables (removed 293) and now considering 24/610 (removed 586) transitions.
// Phase 1: matrix 24 rows 22 cols
[2024-05-22 23:10:11] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:10:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 23:10:11] [INFO ] Invariant cache hit.
[2024-05-22 23:10:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2024-05-22 23:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 24/42 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 4/46 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 276 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 24/42 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 4/46 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 35 constraints, problems are : Problem set: 0 solved, 12 unsolved in 266 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 552ms
Starting structural reductions in LTL mode, iteration 1 : 22/315 places, 24/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 22/315 places, 24/610 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-15
Stuttering criterion allowed to conclude after 18 steps with 2 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-15 finished in 985 ms.
All properties solved by simple procedures.
Total runtime 85838 ms.
ITS solved all properties within timeout

BK_STOP 1716419413199

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AirplaneLD-PT-0100, 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 r003-smll-171620117300268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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