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.r021-smll-171620128100178.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 gold2023
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 r021-smll-171620128100178
=====================================================================

--------------------
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 1716504984989

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0500
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 22:56:28] [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-23 22:56:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:56:28] [INFO ] Load time of PNML (sax parser for PT used): 704 ms
[2024-05-23 22:56:28] [INFO ] Transformed 3519 places.
[2024-05-23 22:56:28] [INFO ] Transformed 4008 transitions.
[2024-05-23 22:56:28] [INFO ] Found NUPN structural information;
[2024-05-23 22:56:29] [INFO ] Parsed PT model containing 3519 places and 4008 transitions and 15278 arcs in 921 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 67 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 106 ms. Remains 1520 /2017 variables (removed 497) and now considering 3020/4008 (removed 988) transitions.
// Phase 1: matrix 3020 rows 1520 cols
[2024-05-23 22:56:30] [INFO ] Computed 1 invariants in 379 ms
[2024-05-23 22:56:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-23 22:56:30] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2024-05-23 22:56:30] [INFO ] Invariant cache hit.
[2024-05-23 22:56:31] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2024-05-23 22:56:31] [INFO ] Invariant cache hit.
[2024-05-23 22:56:34] [INFO ] Dead Transitions using invariants and state equation in 2861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1520/2017 places, 3020/4008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5081 ms. Remains : 1520/2017 places, 3020/4008 transitions.
Support contains 1518 out of 1520 places after structural reductions.
[2024-05-23 22:56:35] [INFO ] Flatten gal took : 325 ms
[2024-05-23 22:56:35] [INFO ] Flatten gal took : 244 ms
[2024-05-23 22:56:36] [INFO ] Input system was already deterministic with 3020 transitions.
Incomplete random walk after 10000 steps, including 1246 resets, run finished after 1334 ms. (steps per millisecond=7 ) properties (out of 22) seen :18
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-23 22:56:37] [INFO ] Invariant cache hit.
[2024-05-23 22:56:39] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:56:40] [INFO ] After 1791ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
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.202304061127/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 75 ms. Remains 517 /1520 variables (removed 1003) and now considering 1014/3020 (removed 2006) transitions.
// Phase 1: matrix 1014 rows 517 cols
[2024-05-23 22:56:41] [INFO ] Computed 1 invariants in 92 ms
[2024-05-23 22:56:41] [INFO ] Implicit Places using invariants in 227 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 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 312 ms. Remains : 516/1520 places, 1014/3020 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 324 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s5 1) (EQ s395 1)) (AND (EQ s5 1) (EQ s135 1)) (AND (EQ s5 1) (EQ s200 1)) (AND (EQ s5 1) (EQ s460 1)) (AND (EQ s5 1) (EQ s70 1)) (AND (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 4 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-01 finished in 734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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.18 ms
Discarding 256 places :
Also discarding 508 output transitions
Drop transitions 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 145 ms. Remains 266 /1520 variables (removed 1254) and now considering 516/3020 (removed 2504) transitions.
// Phase 1: matrix 516 rows 266 cols
[2024-05-23 22:56:42] [INFO ] Computed 1 invariants in 25 ms
[2024-05-23 22:56:42] [INFO ] Implicit Places using invariants in 125 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 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 removed 1 transitions
Drop transitions 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 24 ms. Remains 263 /265 variables (removed 2) and now considering 514/516 (removed 2) transitions.
// Phase 1: matrix 514 rows 263 cols
[2024-05-23 22:56:42] [INFO ] Computed 0 invariants in 23 ms
[2024-05-23 22:56:42] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-23 22:56:42] [INFO ] Invariant cache hit.
[2024-05-23 22:56:42] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 408 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 707 ms. Remains : 263/1520 places, 514/3020 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s6 1) (NEQ s30 1)) (OR (NEQ s6 1) (NEQ s160 1)) (OR (NEQ s6 1) (NEQ s95 1)) (OR (NEQ s6 1) (NEQ s233 1)) (OR (NEQ s6 1) (NEQ s152 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 16990 reset in 4089 ms.
Product exploration explored 100000 steps with 17030 reset in 3556 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 23 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 8696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 60 ms. Remains 19 /1520 variables (removed 1501) and now considering 18/3020 (removed 3002) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:56:50] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:56:50] [INFO ] Implicit Places using invariants in 41 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/1520 places, 18/3020 transitions.
Applied a total of 0 rules in 2 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 106 ms. Remains : 18/1520 places, 18/3020 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-04 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 71 ms. Remains 270 /1520 variables (removed 1250) and now considering 520/3020 (removed 2500) transitions.
// Phase 1: matrix 520 rows 270 cols
[2024-05-23 22:56:51] [INFO ] Computed 1 invariants in 26 ms
[2024-05-23 22:56:51] [INFO ] Implicit Places using invariants in 131 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 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.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions 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 23 ms. Remains 267 /269 variables (removed 2) and now considering 518/520 (removed 2) transitions.
// Phase 1: matrix 518 rows 267 cols
[2024-05-23 22:56:51] [INFO ] Computed 0 invariants in 25 ms
[2024-05-23 22:56:51] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-23 22:56:51] [INFO ] Invariant cache hit.
[2024-05-23 22:56:51] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 387 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 616 ms. Remains : 267/1520 places, 518/3020 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s264 1) (AND (EQ s9 1) (EQ s19 1)) (AND (EQ s9 1) (EQ s84 1)) (AND (EQ s9 1) (EQ s149 1)) (AND (EQ s9 1) (EQ s214 1)) (AND (EQ s9 1) (EQ s11 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 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 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 55 ms. Remains 269 /1520 variables (removed 1251) and now considering 518/3020 (removed 2502) transitions.
// Phase 1: matrix 518 rows 269 cols
[2024-05-23 22:56:51] [INFO ] Computed 1 invariants in 15 ms
[2024-05-23 22:56:52] [INFO ] Implicit Places using invariants in 117 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 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 4 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 179 ms. Remains : 268/1520 places, 518/3020 transitions.
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (NEQ s8 1) (NEQ s32 1)) (OR (NEQ s8 1) (NEQ s162 1)) (OR (NEQ s8 1) (NEQ s97 1)) (OR (NEQ s8 1) (NEQ s235 1)) (OR (NEQ s8 1) (NEQ s154 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-07 finished in 363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 34 ms. Remains 20 /1520 variables (removed 1500) and now considering 20/3020 (removed 3000) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 22:56:52] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:56:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 22:56:52] [INFO ] Invariant cache hit.
[2024-05-23 22:56:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-23 22:56:52] [INFO ] Invariant cache hit.
[2024-05-23 22:56:52] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/1520 places, 20/3020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 20/1520 places, 20/3020 transitions.
Stuttering acceptance computed with spot in 159 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 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s0 1) (EQ s2 1)), p0:(OR (EQ s9 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12540 reset in 193 ms.
Product exploration explored 100000 steps with 12578 reset in 209 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 21 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 801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 73 ms. Remains 21 /1520 variables (removed 1499) and now considering 22/3020 (removed 2998) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 22:56:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:56:53] [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 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 removed 1 transitions
Drop transitions 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 2 ms. Remains 18 /20 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-05-23 22:56:53] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 22:56:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 22:56:53] [INFO ] Invariant cache hit.
[2024-05-23 22:56:53] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 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 176 ms. Remains : 18/1520 places, 20/3020 transitions.
Stuttering acceptance computed with spot in 416 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 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={1} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 5}, { cond=(OR p1 p0), acceptance={1} source=3 dest: 6}, { cond=(OR p1 p0), acceptance={0, 1} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={1} source=4 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 5}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=4 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={1} source=6 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={1} source=7 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=7 dest: 7}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s12 1)), p0:(EQ s16 1), p2:(AND (EQ s9 1) (EQ s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 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 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 22 ms. Remains 19 /1520 variables (removed 1501) and now considering 18/3020 (removed 3002) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:56:53] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:56:53] [INFO ] Implicit Places using invariants in 29 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 18/1520 places, 18/3020 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s2 1) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-10 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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.6 ms
Discarding 510 places :
Also discarding 1012 output transitions
Drop transitions 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 42 ms. Remains 12 /1520 variables (removed 1508) and now considering 12/3020 (removed 3008) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-23 22:56:53] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:56:53] [INFO ] Implicit Places using invariants in 25 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 10 cols
[2024-05-23 22:56:53] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 22:56:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 22:56:53] [INFO ] Invariant cache hit.
[2024-05-23 22:56:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 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 112 ms. Remains : 10/1520 places, 11/3020 transitions.
Stuttering acceptance computed with spot in 79 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s1 1) (EQ s2 1)) (EQ s7 1)), p0:(AND (EQ s4 1) (EQ s6 1)), p2:(AND (EQ s1 1) (EQ s3 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 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 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 21 ms. Remains 21 /1520 variables (removed 1499) and now considering 22/3020 (removed 2998) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 22:56:54] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:56:54] [INFO ] Implicit Places using invariants in 29 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 : 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 53 ms. Remains : 20/1520 places, 22/3020 transitions.
Stuttering acceptance computed with spot in 234 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s14 1)), p1:(AND (NOT (AND (EQ s11 1) (EQ s13 1))) (EQ s2 1) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-12 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 19 ms. Remains 21 /1520 variables (removed 1499) and now considering 22/3020 (removed 2998) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 22:56:54] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:56:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 22:56:54] [INFO ] Invariant cache hit.
[2024-05-23 22:56:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-23 22:56:54] [INFO ] Invariant cache hit.
[2024-05-23 22:56:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/1520 places, 22/3020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 21/1520 places, 22/3020 transitions.
Stuttering acceptance computed with spot in 215 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 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s2 0)), p2:(AND (EQ s6 1) (EQ s9 1)), p1:(OR (EQ s13 0) (EQ s15 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12854 reset in 304 ms.
Product exploration explored 100000 steps with 12837 reset in 227 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 (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 1202 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 197 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Finished random walk after 163 steps, including 18 resets, run visited all 6 properties in 3 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F p2), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 7 factoid took 1560 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 194 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 162 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 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-23 22:56:58] [INFO ] Invariant cache hit.
[2024-05-23 22:56:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 22:56:58] [INFO ] Invariant cache hit.
[2024-05-23 22:56:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-23 22:56:58] [INFO ] Invariant cache hit.
[2024-05-23 22:56:58] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 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 (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 5 factoid took 654 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 175 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Finished random walk after 150 steps, including 17 resets, run visited all 6 properties in 4 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (NOT (AND (NOT p2) p0 p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F p2), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 5 factoid took 1030 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 172 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 242 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 202 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 12863 reset in 214 ms.
Product exploration explored 100000 steps with 12838 reset in 244 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 210 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 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-23 22:57:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:57:02] [INFO ] Invariant cache hit.
[2024-05-23 22:57:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin8286427975707183506
[2024-05-23 22:57:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8286427975707183506
Running compilation step : cd /tmp/ltsmin8286427975707183506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 291 ms.
Running link step : cd /tmp/ltsmin8286427975707183506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin8286427975707183506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4677791953318250537.hoa' '--buchi-type=spotba'
LTSmin run took 289 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0500-LTLFireability-14 finished in 8681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 23 ms. Remains 20 /1520 variables (removed 1500) and now considering 20/3020 (removed 3000) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 22:57:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:57:03] [INFO ] Implicit Places using invariants in 37 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 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 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 19/1520 places, 20/3020 transitions.
Stuttering acceptance computed with spot in 171 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s5 1) (EQ s8 1)), p1:(EQ s15 1), p2:(OR (EQ s2 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-15 finished in 266 ms.
All properties solved by simple procedures.
Total runtime 35299 ms.

BK_STOP 1716505024964

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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 gold2023"
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 r021-smll-171620128100178"
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 ;