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.r464-smll-171620118200260.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 ltsminxred
Input is AirplaneLD-PT-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118200260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 42K Apr 12 03:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 202K Apr 12 03:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 12 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 143K 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 93K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 62K Apr 12 03:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 391K Apr 12 03:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.9K 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 219K 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-0050-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717249641871

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:47:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:47:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:47:24] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2024-06-01 13:47:24] [INFO ] Transformed 369 places.
[2024-06-01 13:47:24] [INFO ] Transformed 408 transitions.
[2024-06-01 13:47:24] [INFO ] Found NUPN structural information;
[2024-06-01 13:47:24] [INFO ] Parsed PT model containing 369 places and 408 transitions and 1553 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 152 places and 0 transitions.
FORMULA AirplaneLD-PT-0050-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 408/408 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 408
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 124 place count 93 transition count 287
Iterating global reduction 1 with 121 rules applied. Total rules applied 245 place count 93 transition count 287
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 366 place count 93 transition count 166
Applied a total of 366 rules in 71 ms. Remains 93 /217 variables (removed 124) and now considering 166/408 (removed 242) transitions.
// Phase 1: matrix 166 rows 93 cols
[2024-06-01 13:47:25] [INFO ] Computed 1 invariants in 40 ms
[2024-06-01 13:47:25] [INFO ] Implicit Places using invariants in 342 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 406 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/217 places, 166/408 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 521 ms. Remains : 92/217 places, 166/408 transitions.
Support contains 87 out of 92 places after structural reductions.
[2024-06-01 13:47:26] [INFO ] Flatten gal took : 64 ms
[2024-06-01 13:47:26] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:47:26] [INFO ] Input system was already deterministic with 166 transitions.
RANDOM walk for 40000 steps (5118 resets) in 2057 ms. (19 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40004 steps (272 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (180 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
// Phase 1: matrix 166 rows 92 cols
[2024-06-01 13:47:27] [INFO ] Computed 0 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (OVERLAPS) 136/200 variables, 57/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/254 variables, 28/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/256 variables, 1/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/258 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 92 constraints, problems are : Problem set: 1 solved, 1 unsolved in 234 ms.
Refiners :[State Equation: 92/92 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) 52/54 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 127/181 variables, 52/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 56/237 variables, 27/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/249 variables, 6/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/254 variables, 3/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/256 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/258 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 93 constraints, problems are : Problem set: 1 solved, 1 unsolved in 254 ms.
Refiners :[State Equation: 92/92 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 92 stabilizing places and 166 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 166
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-PT-0050-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&(p1||G(F(p2))))))'
Support contains 28 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 42 transition count 116
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 42 transition count 116
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 150 place count 42 transition count 66
Applied a total of 150 rules in 6 ms. Remains 42 /92 variables (removed 50) and now considering 66/166 (removed 100) transitions.
// Phase 1: matrix 66 rows 42 cols
[2024-06-01 13:47:28] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:47:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 13:47:28] [INFO ] Invariant cache hit.
[2024-06-01 13:47:28] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-06-01 13:47:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 66/103 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 5/108 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 0/108 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 42 constraints, problems are : Problem set: 0 solved, 33 unsolved in 801 ms.
Refiners :[State Equation: 42/42 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 66/103 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 5/108 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 75 constraints, problems are : Problem set: 0 solved, 33 unsolved in 981 ms.
Refiners :[State Equation: 42/42 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 1857ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1861ms
Starting structural reductions in LTL mode, iteration 1 : 42/92 places, 66/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2019 ms. Remains : 42/92 places, 66/166 transitions.
Stuttering acceptance computed with spot in 523 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-00
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 3 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-00 finished in 2659 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(p0) U X(p1))||X(F(p2))))'
Support contains 52 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 67 transition count 141
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 67 transition count 141
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 75 place count 67 transition count 116
Applied a total of 75 rules in 5 ms. Remains 67 /92 variables (removed 25) and now considering 116/166 (removed 50) transitions.
// Phase 1: matrix 116 rows 67 cols
[2024-06-01 13:47:30] [INFO ] Computed 0 invariants in 2 ms
[2024-06-01 13:47:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 13:47:30] [INFO ] Invariant cache hit.
[2024-06-01 13:47:31] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 13:47:31] [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) 116/178 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 5/183 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 0/183 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 67 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1870 ms.
Refiners :[State Equation: 67/67 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) 116/178 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 58/120 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 5/183 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 125 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3207 ms.
Refiners :[State Equation: 67/67 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 5263ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 5266ms
Starting structural reductions in LTL mode, iteration 1 : 67/92 places, 116/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5445 ms. Remains : 67/92 places, 116/166 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-02
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-02 finished in 5742 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 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 18 transition count 92
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 18 transition count 92
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 222 place count 18 transition count 18
Applied a total of 222 rules in 4 ms. Remains 18 /92 variables (removed 74) and now considering 18/166 (removed 148) transitions.
// Phase 1: matrix 18 rows 18 cols
[2024-06-01 13:47:36] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 13:47:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 13:47:36] [INFO ] Invariant cache hit.
[2024-06-01 13:47:36] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 13:47:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 175 ms.
Refiners :[State Equation: 18/18 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 173 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 363ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 363ms
Starting structural reductions in LTL mode, iteration 1 : 18/92 places, 18/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 18/92 places, 18/166 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-03 finished in 609 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(G(p1))&&p0))))'
Support contains 26 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 41 transition count 115
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 41 transition count 115
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 153 place count 41 transition count 64
Applied a total of 153 rules in 4 ms. Remains 41 /92 variables (removed 51) and now considering 64/166 (removed 102) transitions.
// Phase 1: matrix 64 rows 41 cols
[2024-06-01 13:47:37] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:47:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 13:47:37] [INFO ] Invariant cache hit.
[2024-06-01 13:47:37] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 13:47:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 64/100 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 5/105 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 0/105 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 41 constraints, problems are : Problem set: 0 solved, 32 unsolved in 727 ms.
Refiners :[State Equation: 41/41 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 64/100 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 32/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 5/105 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 73 constraints, problems are : Problem set: 0 solved, 32 unsolved in 954 ms.
Refiners :[State Equation: 41/41 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1721ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1724ms
Starting structural reductions in LTL mode, iteration 1 : 41/92 places, 64/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1859 ms. Remains : 41/92 places, 64/166 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-04 finished in 2110 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 (X(!X(p1)) U p2))))'
Support contains 29 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 44 transition count 118
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 44 transition count 118
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 144 place count 44 transition count 70
Applied a total of 144 rules in 9 ms. Remains 44 /92 variables (removed 48) and now considering 70/166 (removed 96) transitions.
// Phase 1: matrix 70 rows 44 cols
[2024-06-01 13:47:39] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:47:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 13:47:39] [INFO ] Invariant cache hit.
[2024-06-01 13:47:39] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 35 sub problems to find dead transitions.
[2024-06-01 13:47:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 70/109 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 5/114 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 0/114 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 44 constraints, problems are : Problem set: 0 solved, 35 unsolved in 829 ms.
Refiners :[State Equation: 44/44 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 70/109 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 5/114 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 79 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1161 ms.
Refiners :[State Equation: 44/44 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 2022ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 2024ms
Starting structural reductions in LTL mode, iteration 1 : 44/92 places, 70/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2170 ms. Remains : 44/92 places, 70/166 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), p1, true]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-05
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-05 finished in 2453 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))'
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 18 transition count 92
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 18 transition count 92
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 222 place count 18 transition count 18
Applied a total of 222 rules in 4 ms. Remains 18 /92 variables (removed 74) and now considering 18/166 (removed 148) transitions.
// Phase 1: matrix 18 rows 18 cols
[2024-06-01 13:47:41] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:47:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 13:47:41] [INFO ] Invariant cache hit.
[2024-06-01 13:47:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 13:47:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 169 ms.
Refiners :[State Equation: 18/18 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 163 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 340ms
Starting structural reductions in LTL mode, iteration 1 : 18/92 places, 18/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 18/92 places, 18/166 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-07 finished in 589 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||G(p1)))))'
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Graph (complete) has 90 edges and 92 vertex of which 91 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 90 transition count 164
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 76 place count 17 transition count 91
Iterating global reduction 2 with 73 rules applied. Total rules applied 149 place count 17 transition count 91
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 222 place count 17 transition count 18
Applied a total of 222 rules in 25 ms. Remains 17 /92 variables (removed 75) and now considering 18/166 (removed 148) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-06-01 13:47:42] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:47:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 13:47:42] [INFO ] Invariant cache hit.
[2024-06-01 13:47:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 13:47:42] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 13:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/29 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 94 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/29 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 6/35 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 25 constraints, problems are : Problem set: 0 solved, 8 unsolved in 100 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/92 places, 18/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 17/92 places, 18/166 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-08 finished in 457 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)&&X(X(F(p2))))))'
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 19 transition count 93
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 19 transition count 93
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 219 place count 19 transition count 20
Applied a total of 219 rules in 5 ms. Remains 19 /92 variables (removed 73) and now considering 20/166 (removed 146) transitions.
// Phase 1: matrix 20 rows 19 cols
[2024-06-01 13:47:42] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:47:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 13:47:42] [INFO ] Invariant cache hit.
[2024-06-01 13:47:42] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 13:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/39 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 135 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/39 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 29 constraints, problems are : Problem set: 0 solved, 10 unsolved in 142 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 283ms
Starting structural reductions in LTL mode, iteration 1 : 19/92 places, 20/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 19/92 places, 20/166 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-11 finished in 728 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(p0)))))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 18 transition count 92
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 18 transition count 92
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 222 place count 18 transition count 18
Applied a total of 222 rules in 5 ms. Remains 18 /92 variables (removed 74) and now considering 18/166 (removed 148) transitions.
// Phase 1: matrix 18 rows 18 cols
[2024-06-01 13:47:43] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 13:47:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 13:47:43] [INFO ] Invariant cache hit.
[2024-06-01 13:47:43] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 13:47:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 176 ms.
Refiners :[State Equation: 18/18 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 162 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 346ms
Starting structural reductions in LTL mode, iteration 1 : 18/92 places, 18/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 18/92 places, 18/166 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-12 finished in 671 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(F((p0||G((p1||X(p2))))))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 19 transition count 93
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 19 transition count 93
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 219 place count 19 transition count 20
Applied a total of 219 rules in 3 ms. Remains 19 /92 variables (removed 73) and now considering 20/166 (removed 146) transitions.
// Phase 1: matrix 20 rows 19 cols
[2024-06-01 13:47:44] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 13:47:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 13:47:44] [INFO ] Invariant cache hit.
[2024-06-01 13:47:44] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 13:47:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/39 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 170 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/39 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 29 constraints, problems are : Problem set: 0 solved, 10 unsolved in 196 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 374ms
Starting structural reductions in LTL mode, iteration 1 : 19/92 places, 20/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 19/92 places, 20/166 transitions.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-14
Product exploration explored 100000 steps with 22689 reset in 684 ms.
Product exploration explored 100000 steps with 22788 reset in 240 ms.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 20
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) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 31 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLFireability-14 finished in 1840 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)))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 166/166 transitions.
Graph (complete) has 90 edges and 92 vertex of which 39 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 101 output transitions
Drop transitions (Output transitions of discarded places.) removed 101 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 38 transition count 64
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 28 place count 13 transition count 39
Iterating global reduction 2 with 25 rules applied. Total rules applied 53 place count 13 transition count 39
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 78 place count 13 transition count 14
Applied a total of 78 rules in 5 ms. Remains 13 /92 variables (removed 79) and now considering 14/166 (removed 152) transitions.
// Phase 1: matrix 14 rows 13 cols
[2024-06-01 13:47:46] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:47:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 13:47:46] [INFO ] Invariant cache hit.
[2024-06-01 13:47:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 13:47:46] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 13:47:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 13/22 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/27 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 70 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 13/22 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 5/27 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 109 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/92 places, 14/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 13/92 places, 14/166 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-15
Product exploration explored 100000 steps with 17039 reset in 261 ms.
Product exploration explored 100000 steps with 17010 reset in 303 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 14
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 18 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLFireability-15 finished in 942 ms.
All properties solved by simple procedures.
Total runtime 22759 ms.
ITS solved all properties within timeout

BK_STOP 1717249667390

--------------------
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-0050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AirplaneLD-PT-0050, 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 r464-smll-171620118200260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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