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.r004-smll-171620118200284.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 itstools
Input is AirplaneLD-PT-0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118200284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 100K Apr 12 03:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 389K Apr 12 03:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 12 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:45 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 220K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 569K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 470K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 630K Apr 12 04:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 12 04:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 512K Apr 12 04:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 12 04:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 47K 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 2.2M 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-0500-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716413575616

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 21:32:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 21:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:32:59] [INFO ] Load time of PNML (sax parser for PT used): 803 ms
[2024-05-22 21:32:59] [INFO ] Transformed 3519 places.
[2024-05-22 21:32:59] [INFO ] Transformed 4008 transitions.
[2024-05-22 21:32:59] [INFO ] Found NUPN structural information;
[2024-05-22 21:32:59] [INFO ] Parsed PT model containing 3519 places and 4008 transitions and 15278 arcs in 1263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 86 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1502 places and 0 transitions.
FORMULA AirplaneLD-PT-0500-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1518 out of 2017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2017/2017 places, 4008/4008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2014 transition count 4008
Discarding 494 places :
Symmetric choice reduction at 1 with 494 rule applications. Total rules 497 place count 1520 transition count 3514
Iterating global reduction 1 with 494 rules applied. Total rules applied 991 place count 1520 transition count 3514
Ensure Unique test removed 494 transitions
Reduce isomorphic transitions removed 494 transitions.
Iterating post reduction 1 with 494 rules applied. Total rules applied 1485 place count 1520 transition count 3020
Applied a total of 1485 rules in 162 ms. Remains 1520 /2017 variables (removed 497) and now considering 3020/4008 (removed 988) transitions.
// Phase 1: matrix 3020 rows 1520 cols
[2024-05-22 21:33:00] [INFO ] Computed 1 invariants in 529 ms
[2024-05-22 21:33:01] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2024-05-22 21:33:01] [INFO ] Invariant cache hit.
[2024-05-22 21:33:04] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 3653 ms to find 0 implicit places.
Running 1510 sub problems to find dead transitions.
[2024-05-22 21:33:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/4540 variables, and 0 constraints, problems are : Problem set: 0 solved, 1510 unsolved in 30118 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 1510/510 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/4540 variables, and 0 constraints, problems are : Problem set: 0 solved, 1510 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 1000/510 constraints, Known Traps: 0/0 constraints]
After SMT, in 80758ms problems are : Problem set: 0 solved, 1510 unsolved
Search for dead transitions found 0 dead transitions in 80881ms
Starting structural reductions in LTL mode, iteration 1 : 1520/2017 places, 3020/4008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84755 ms. Remains : 1520/2017 places, 3020/4008 transitions.
Support contains 1518 out of 1520 places after structural reductions.
[2024-05-22 21:34:25] [INFO ] Flatten gal took : 325 ms
[2024-05-22 21:34:25] [INFO ] Flatten gal took : 206 ms
[2024-05-22 21:34:26] [INFO ] Input system was already deterministic with 3020 transitions.
RANDOM walk for 40000 steps (4987 resets) in 5731 ms. (6 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (12 resets) in 2704 ms. (14 steps per ms) remains 1/1 properties
[2024-05-22 21:34:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1505/2009 variables, 504/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2009 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 3268/4540 variables, and 1009 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1205 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 1009/1520 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1986ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AirplaneLD-PT-0500-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1520 stabilizing places and 3020 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1520 transition count 3020
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' '!(G((X(p0)||F(p1))))'
Support contains 501 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1003 places :
Symmetric choice reduction at 0 with 1003 rule applications. Total rules 1003 place count 517 transition count 2017
Iterating global reduction 0 with 1003 rules applied. Total rules applied 2006 place count 517 transition count 2017
Ensure Unique test removed 1003 transitions
Reduce isomorphic transitions removed 1003 transitions.
Iterating post reduction 0 with 1003 rules applied. Total rules applied 3009 place count 517 transition count 1014
Applied a total of 3009 rules in 80 ms. Remains 517 /1520 variables (removed 1003) and now considering 1014/3020 (removed 2006) transitions.
// Phase 1: matrix 1014 rows 517 cols
[2024-05-22 21:34:31] [INFO ] Computed 1 invariants in 61 ms
[2024-05-22 21:34:31] [INFO ] Implicit Places using invariants in 167 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/1520 places, 1014/3020 transitions.
Applied a total of 0 rules in 4 ms. Remains 516 /516 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 257 ms. Remains : 516/1520 places, 1014/3020 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-01
Stuttering criterion allowed to conclude after 38 steps with 9 reset in 7 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-01 finished in 630 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 252 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Graph (complete) has 2268 edges and 1520 vertex of which 1264 are kept as prefixes of interest. Removing 256 places using SCC suffix rule.16 ms
Discarding 256 places :
Also discarding 508 output transitions
Drop transitions (Output transitions of discarded places.) removed 508 transitions
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 999 place count 266 transition count 1514
Iterating global reduction 0 with 998 rules applied. Total rules applied 1997 place count 266 transition count 1514
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Iterating post reduction 0 with 998 rules applied. Total rules applied 2995 place count 266 transition count 516
Applied a total of 2995 rules in 99 ms. Remains 266 /1520 variables (removed 1254) and now considering 516/3020 (removed 2504) transitions.
// Phase 1: matrix 516 rows 266 cols
[2024-05-22 21:34:31] [INFO ] Computed 1 invariants in 17 ms
[2024-05-22 21:34:31] [INFO ] Implicit Places using invariants in 84 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 265/1520 places, 516/3020 transitions.
Graph (complete) has 263 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 264 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 263 transition count 514
Applied a total of 3 rules in 16 ms. Remains 263 /265 variables (removed 2) and now considering 514/516 (removed 2) transitions.
// Phase 1: matrix 514 rows 263 cols
[2024-05-22 21:34:31] [INFO ] Computed 0 invariants in 15 ms
[2024-05-22 21:34:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 21:34:31] [INFO ] Invariant cache hit.
[2024-05-22 21:34:32] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 263/1520 places, 514/3020 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 517 ms. Remains : 263/1520 places, 514/3020 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-02
Product exploration explored 100000 steps with 17012 reset in 3492 ms.
Product exploration explored 100000 steps with 17047 reset in 3287 ms.
Computed a total of 263 stabilizing places and 514 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 263 transition count 514
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-0500-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-02 finished in 7635 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))))'
Support contains 1 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1501 places :
Symmetric choice reduction at 0 with 1501 rule applications. Total rules 1501 place count 19 transition count 1519
Iterating global reduction 0 with 1501 rules applied. Total rules applied 3002 place count 19 transition count 1519
Ensure Unique test removed 1501 transitions
Reduce isomorphic transitions removed 1501 transitions.
Iterating post reduction 0 with 1501 rules applied. Total rules applied 4503 place count 19 transition count 18
Applied a total of 4503 rules in 35 ms. Remains 19 /1520 variables (removed 1501) and now considering 18/3020 (removed 3002) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 21:34:39] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 21:34:39] [INFO ] Implicit Places using invariants in 30 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/1520 places, 18/3020 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 67 ms. Remains : 18/1520 places, 18/3020 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-04 finished in 196 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 253 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1250 places :
Symmetric choice reduction at 0 with 1250 rule applications. Total rules 1250 place count 270 transition count 1770
Iterating global reduction 0 with 1250 rules applied. Total rules applied 2500 place count 270 transition count 1770
Ensure Unique test removed 1250 transitions
Reduce isomorphic transitions removed 1250 transitions.
Iterating post reduction 0 with 1250 rules applied. Total rules applied 3750 place count 270 transition count 520
Applied a total of 3750 rules in 55 ms. Remains 270 /1520 variables (removed 1250) and now considering 520/3020 (removed 2500) transitions.
// Phase 1: matrix 520 rows 270 cols
[2024-05-22 21:34:39] [INFO ] Computed 1 invariants in 16 ms
[2024-05-22 21:34:39] [INFO ] Implicit Places using invariants in 82 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/1520 places, 520/3020 transitions.
Graph (complete) has 267 edges and 269 vertex of which 268 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 268 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 267 transition count 518
Applied a total of 3 rules in 13 ms. Remains 267 /269 variables (removed 2) and now considering 518/520 (removed 2) transitions.
// Phase 1: matrix 518 rows 267 cols
[2024-05-22 21:34:39] [INFO ] Computed 0 invariants in 15 ms
[2024-05-22 21:34:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 21:34:39] [INFO ] Invariant cache hit.
[2024-05-22 21:34:39] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 267/1520 places, 518/3020 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 469 ms. Remains : 267/1520 places, 518/3020 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-06 finished in 559 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))))'
Support contains 252 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1251 places :
Symmetric choice reduction at 0 with 1251 rule applications. Total rules 1251 place count 269 transition count 1769
Iterating global reduction 0 with 1251 rules applied. Total rules applied 2502 place count 269 transition count 1769
Ensure Unique test removed 1251 transitions
Reduce isomorphic transitions removed 1251 transitions.
Iterating post reduction 0 with 1251 rules applied. Total rules applied 3753 place count 269 transition count 518
Applied a total of 3753 rules in 24 ms. Remains 269 /1520 variables (removed 1251) and now considering 518/3020 (removed 2502) transitions.
// Phase 1: matrix 518 rows 269 cols
[2024-05-22 21:34:40] [INFO ] Computed 1 invariants in 8 ms
[2024-05-22 21:34:40] [INFO ] Implicit Places using invariants in 74 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 268/1520 places, 518/3020 transitions.
Applied a total of 0 rules in 2 ms. Remains 268 /268 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 268/1520 places, 518/3020 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-07 finished in 226 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(G(p0))||G(p1))))'
Support contains 4 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1500 places :
Symmetric choice reduction at 0 with 1500 rule applications. Total rules 1500 place count 20 transition count 1520
Iterating global reduction 0 with 1500 rules applied. Total rules applied 3000 place count 20 transition count 1520
Ensure Unique test removed 1500 transitions
Reduce isomorphic transitions removed 1500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 4500 place count 20 transition count 20
Applied a total of 4500 rules in 17 ms. Remains 20 /1520 variables (removed 1500) and now considering 20/3020 (removed 3000) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-22 21:34:40] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 21:34:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 21:34:40] [INFO ] Invariant cache hit.
[2024-05-22 21:34:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-22 21:34:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/40 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/40 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 332ms
Starting structural reductions in LTL mode, iteration 1 : 20/1520 places, 20/3020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 20/1520 places, 20/3020 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-08
Product exploration explored 100000 steps with 12558 reset in 247 ms.
Product exploration explored 100000 steps with 12589 reset in 194 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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) p0), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
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 4 factoid took 19 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0500-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-08 finished in 1071 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 U p1))&&X(X(G(p2))))))'
Support contains 4 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1499 places :
Symmetric choice reduction at 0 with 1499 rule applications. Total rules 1499 place count 21 transition count 1521
Iterating global reduction 0 with 1499 rules applied. Total rules applied 2998 place count 21 transition count 1521
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 0 with 1499 rules applied. Total rules applied 4497 place count 21 transition count 22
Applied a total of 4497 rules in 41 ms. Remains 21 /1520 variables (removed 1499) and now considering 22/3020 (removed 2998) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-22 21:34:41] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 21:34:41] [INFO ] Implicit Places using invariants in 33 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/1520 places, 22/3020 transitions.
Graph (complete) has 18 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 18 transition count 20
Applied a total of 3 rules in 1 ms. Remains 18 /20 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-05-22 21:34:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 21:34:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 21:34:41] [INFO ] Invariant cache hit.
[2024-05-22 21:34:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/1520 places, 20/3020 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 18/1520 places, 20/3020 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-09 finished in 557 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(X(F(p0))))))'
Support contains 2 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1501 places :
Symmetric choice reduction at 0 with 1501 rule applications. Total rules 1501 place count 19 transition count 1519
Iterating global reduction 0 with 1501 rules applied. Total rules applied 3002 place count 19 transition count 1519
Ensure Unique test removed 1501 transitions
Reduce isomorphic transitions removed 1501 transitions.
Iterating post reduction 0 with 1501 rules applied. Total rules applied 4503 place count 19 transition count 18
Applied a total of 4503 rules in 17 ms. Remains 19 /1520 variables (removed 1501) and now considering 18/3020 (removed 3002) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-22 21:34:41] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 21:34:41] [INFO ] Implicit Places using invariants in 27 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/1520 places, 18/3020 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 45 ms. Remains : 18/1520 places, 18/3020 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-10 finished in 255 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(F(p0))||G(p1)||G(p2))))'
Support contains 6 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Graph (complete) has 2268 edges and 1520 vertex of which 1010 are kept as prefixes of interest. Removing 510 places using SCC suffix rule.5 ms
Discarding 510 places :
Also discarding 1012 output transitions
Drop transitions (Output transitions of discarded places.) removed 1012 transitions
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 999 place count 12 transition count 1010
Iterating global reduction 0 with 998 rules applied. Total rules applied 1997 place count 12 transition count 1010
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Iterating post reduction 0 with 998 rules applied. Total rules applied 2995 place count 12 transition count 12
Applied a total of 2995 rules in 34 ms. Remains 12 /1520 variables (removed 1508) and now considering 12/3020 (removed 3008) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-22 21:34:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 21:34:42] [INFO ] Implicit Places using invariants in 22 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/1520 places, 12/3020 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 0 ms. Remains 10 /11 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 10 cols
[2024-05-22 21:34:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 21:34:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 21:34:42] [INFO ] Invariant cache hit.
[2024-05-22 21:34:42] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/1520 places, 11/3020 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 10/1520 places, 11/3020 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-11 finished in 191 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(X(X(!(p0 U p1))))&&F(p0))))'
Support contains 5 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1499 places :
Symmetric choice reduction at 0 with 1499 rule applications. Total rules 1499 place count 21 transition count 1521
Iterating global reduction 0 with 1499 rules applied. Total rules applied 2998 place count 21 transition count 1521
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 0 with 1499 rules applied. Total rules applied 4497 place count 21 transition count 22
Applied a total of 4497 rules in 15 ms. Remains 21 /1520 variables (removed 1499) and now considering 22/3020 (removed 2998) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-22 21:34:42] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 21:34:42] [INFO ] Implicit Places using invariants in 33 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/1520 places, 22/3020 transitions.
Applied a total of 0 rules in 0 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 50 ms. Remains : 20/1520 places, 22/3020 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-12
Stuttering criterion allowed to conclude after 14 steps with 2 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-12 finished in 258 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((X(p1)||p0))||X(F(p2))))'
Support contains 6 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1499 places :
Symmetric choice reduction at 0 with 1499 rule applications. Total rules 1499 place count 21 transition count 1521
Iterating global reduction 0 with 1499 rules applied. Total rules applied 2998 place count 21 transition count 1521
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 0 with 1499 rules applied. Total rules applied 4497 place count 21 transition count 22
Applied a total of 4497 rules in 16 ms. Remains 21 /1520 variables (removed 1499) and now considering 22/3020 (removed 2998) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-22 21:34:42] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 21:34:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 21:34:42] [INFO ] Invariant cache hit.
[2024-05-22 21:34:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-05-22 21:34:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/43 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 176 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 4/43 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 194 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 376ms
Starting structural reductions in LTL mode, iteration 1 : 21/1520 places, 22/3020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 21/1520 places, 22/3020 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-14
Product exploration explored 100000 steps with 12838 reset in 427 ms.
Product exploration explored 100000 steps with 12866 reset in 342 ms.
Computed a total of 21 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 22
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 p2) p1), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 2241 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 867 steps (103 resets) in 24 ms. (34 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 10 factoid took 3418 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-22 21:34:50] [INFO ] Invariant cache hit.
[2024-05-22 21:34:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 21:34:50] [INFO ] Invariant cache hit.
[2024-05-22 21:34:50] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-05-22 21:34:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/43 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 249 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 4/43 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 195 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 453ms
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 21 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 22
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 p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 8 factoid took 1514 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 680 steps (82 resets) in 15 ms. (42 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 8 factoid took 2440 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 12829 reset in 188 ms.
Product exploration explored 100000 steps with 12844 reset in 254 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-22 21:34:56] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-22 21:34:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/43 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 267 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 4/43 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 237 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 525ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 525ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin6094001676481064362
[2024-05-22 21:34:57] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6094001676481064362
Running compilation step : cd /tmp/ltsmin6094001676481064362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 494 ms.
Running link step : cd /tmp/ltsmin6094001676481064362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin6094001676481064362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3715976446755026564.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0500-LTLFireability-14 finished in 15894 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(((p1||X(p2))&&p0))))'
Support contains 5 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 3020/3020 transitions.
Discarding 1500 places :
Symmetric choice reduction at 0 with 1500 rule applications. Total rules 1500 place count 20 transition count 1520
Iterating global reduction 0 with 1500 rules applied. Total rules applied 3000 place count 20 transition count 1520
Ensure Unique test removed 1500 transitions
Reduce isomorphic transitions removed 1500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 4500 place count 20 transition count 20
Applied a total of 4500 rules in 33 ms. Remains 20 /1520 variables (removed 1500) and now considering 20/3020 (removed 3000) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-22 21:34:58] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 21:34:58] [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 : 19/1520 places, 20/3020 transitions.
Applied a total of 0 rules in 1 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 79 ms. Remains : 19/1520 places, 20/3020 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-15 finished in 314 ms.
All properties solved by simple procedures.
Total runtime 120562 ms.

BK_STOP 1716413699168

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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