fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r461-smll-171701122800098
Last Updated
July 7, 2024

About the Execution of 2023-gold for UtilityControlRoom-PT-Z2T3N06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
866.271 25846.00 56728.00 594.10 FTFTFTFTFFFFFFFF normal

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.r461-smll-171701122800098.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 UtilityControlRoom-PT-Z2T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122800098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 13K Apr 13 05:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 05:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 13 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Apr 13 05:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 242K Apr 13 05:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 96K Apr 13 05:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 422K Apr 13 05:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:43 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 UtilityControlRoom-PT-Z2T3N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717174684588

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=UtilityControlRoom-PT-Z2T3N06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 16:58:07] [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-31 16:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:58:08] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-31 16:58:08] [INFO ] Transformed 106 places.
[2024-05-31 16:58:08] [INFO ] Transformed 162 transitions.
[2024-05-31 16:58:08] [INFO ] Parsed PT model containing 106 places and 162 transitions and 510 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-31 16:58:08] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 16:58:08] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 16:58:08] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 16:58:08] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 16:58:08] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 16:58:08] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 16:58:08] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 25 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2024-05-31 16:58:08] [INFO ] Computed 15 invariants in 11 ms
[2024-05-31 16:58:08] [INFO ] Implicit Places using invariants in 391 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 436 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 467 ms. Remains : 105/106 places, 138/138 transitions.
Support contains 84 out of 105 places after structural reductions.
[2024-05-31 16:58:09] [INFO ] Flatten gal took : 71 ms
[2024-05-31 16:58:09] [INFO ] Flatten gal took : 31 ms
[2024-05-31 16:58:09] [INFO ] Input system was already deterministic with 138 transitions.
Finished random walk after 206 steps, including 0 resets, run visited all 17 properties in 48 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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((X(G(p1))&&p0)))'
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 87 transition count 120
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 86 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 80 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 74 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 74 transition count 78
Applied a total of 74 rules in 48 ms. Remains 74 /105 variables (removed 31) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 74 cols
[2024-05-31 16:58:09] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 16:58:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 16:58:10] [INFO ] Invariant cache hit.
[2024-05-31 16:58:10] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-31 16:58:10] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 16:58:10] [INFO ] Invariant cache hit.
[2024-05-31 16:58:10] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 413 ms. Remains : 74/105 places, 78/138 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 317 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s19 1) (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s28 1) (LT s29 1) (LT s30 1)), p1:(OR (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 710 ms.
Stack based approach found an accepted trace after 496 steps with 0 reset with depth 497 and stack size 497 in 5 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-00 finished in 1523 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(p0)))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 8 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-31 16:58:11] [INFO ] Computed 14 invariants in 4 ms
[2024-05-31 16:58:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-31 16:58:11] [INFO ] Invariant cache hit.
[2024-05-31 16:58:11] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-31 16:58:11] [INFO ] Invariant cache hit.
[2024-05-31 16:58:11] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s70 1) (GEQ s69 1) (GEQ s72 1) (GEQ s71 1) (GEQ s74 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 396 ms.
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-01 finished in 1281 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(p0)||(F(p1)&&(!p2 U (G(!p2)||(!p2&&G(!p1)))))))'
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 126
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 81 transition count 114
Applied a total of 48 rules in 12 ms. Remains 81 /105 variables (removed 24) and now considering 114/138 (removed 24) transitions.
// Phase 1: matrix 114 rows 81 cols
[2024-05-31 16:58:12] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 16:58:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 16:58:12] [INFO ] Invariant cache hit.
[2024-05-31 16:58:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-31 16:58:12] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 16:58:12] [INFO ] Invariant cache hit.
[2024-05-31 16:58:13] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/105 places, 114/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 81/105 places, 114/138 transitions.
Stuttering acceptance computed with spot in 515 ms :[(OR (NOT p1) p2), p2, (AND (NOT p0) p2), (AND p2 p1), (AND p2 p1 (NOT p0)), p1, (AND p1 (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 7}, { cond=(AND p0 p2), acceptance={} source=2 dest: 9}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p0 p2), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=8, aps=[p1:(OR (GEQ s57 1) (GEQ s56 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1)), p2:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-02 finished in 847 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(p1)||G((X(p3)&&p2))||p0)))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 11 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-31 16:58:13] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 16:58:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 16:58:13] [INFO ] Invariant cache hit.
[2024-05-31 16:58:13] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-31 16:58:13] [INFO ] Invariant cache hit.
[2024-05-31 16:58:13] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s52 1) (GEQ s79 1)) (AND (GEQ s47 1) (GEQ s76 1)) (AND (GEQ s48 1) (GEQ s77 1)) (AND (GEQ s46 1) (GEQ s76 1)) (AND (GEQ s51 1) (GEQ s78 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 p3))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-03 finished in 1433 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((p0&&F(p1))))'
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 11 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-31 16:58:14] [INFO ] Invariant cache hit.
[2024-05-31 16:58:15] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 16:58:15] [INFO ] Invariant cache hit.
[2024-05-31 16:58:15] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-31 16:58:15] [INFO ] Invariant cache hit.
[2024-05-31 16:58:15] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s70 1) (GEQ s69 1) (GEQ s72 1) (GEQ s71 1) (GEQ s74 1) (GEQ s73 1)), p0:(OR (GEQ s70 1) (GEQ s69 1) (GEQ s72 1) (GEQ s71 1) (GEQ s74 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p0 (NOT p1)))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-05 finished in 1315 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((!p0||X(X(F(!p0))))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 68 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 68 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 62 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 56 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 56 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 50 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 50 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 128 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 44 transition count 42
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 165 place count 31 transition count 30
Applied a total of 165 rules in 36 ms. Remains 31 /105 variables (removed 74) and now considering 30/138 (removed 108) transitions.
// Phase 1: matrix 30 rows 31 cols
[2024-05-31 16:58:16] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 16:58:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 16:58:16] [INFO ] Invariant cache hit.
[2024-05-31 16:58:16] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-31 16:58:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:58:16] [INFO ] Invariant cache hit.
[2024-05-31 16:58:16] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/105 places, 30/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 31/105 places, 30/138 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s19 1) (GEQ s22 1) (GEQ s21 1) (GEQ s24 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4849 reset in 333 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-06 finished in 701 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((!p0||G(F(p0)))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 8 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-31 16:58:17] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 16:58:17] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-31 16:58:17] [INFO ] Invariant cache hit.
[2024-05-31 16:58:17] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-31 16:58:17] [INFO ] Invariant cache hit.
[2024-05-31 16:58:17] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 208 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s57 1) (GEQ s56 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5356 reset in 170 ms.
Product exploration explored 100000 steps with 5261 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-05-31 16:58:18] [INFO ] Invariant cache hit.
[2024-05-31 16:58:19] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-31 16:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:58:19] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 16:58:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:58:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-31 16:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:58:19] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-31 16:58:19] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-31 16:58:19] [INFO ] Added : 20 causal constraints over 4 iterations in 117 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 114
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 84 place count 51 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 96 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 50 transition count 60
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 49 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 43 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 43 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 37 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 37 transition count 42
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 37 transition count 36
Applied a total of 129 rules in 26 ms. Remains 37 /93 variables (removed 56) and now considering 36/126 (removed 90) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-31 16:58:19] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 16:58:19] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 16:58:19] [INFO ] Invariant cache hit.
[2024-05-31 16:58:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-31 16:58:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 16:58:19] [INFO ] Invariant cache hit.
[2024-05-31 16:58:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/93 places, 36/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 37/93 places, 36/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2024-05-31 16:58:20] [INFO ] Invariant cache hit.
[2024-05-31 16:58:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-31 16:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:58:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 16:58:20] [INFO ] Computed and/alt/rep : 30/42/30 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 16:58:20] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5938 reset in 227 ms.
Product exploration explored 100000 steps with 5933 reset in 279 ms.
Built C files in :
/tmp/ltsmin716841691815634323
[2024-05-31 16:58:21] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2024-05-31 16:58:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:58:21] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2024-05-31 16:58:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:58:21] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2024-05-31 16:58:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:58:21] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin716841691815634323
Running compilation step : cd /tmp/ltsmin716841691815634323;'/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 342 ms.
Running link step : cd /tmp/ltsmin716841691815634323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin716841691815634323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14810200655359839421.hoa' '--buchi-type=spotba'
LTSmin run took 5197 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-07 finished in 9693 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(((p1||F(p2))&&p0))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 116
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 55 place count 83 transition count 105
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 55 place count 83 transition count 95
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 75 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 72 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 72 transition count 94
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 119 place count 51 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 50 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 50 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 44 transition count 49
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 44 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 39 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 39 transition count 44
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 149 place count 39 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 35 transition count 35
Applied a total of 157 rules in 35 ms. Remains 35 /105 variables (removed 70) and now considering 35/138 (removed 103) transitions.
// Phase 1: matrix 35 rows 35 cols
[2024-05-31 16:58:26] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 16:58:26] [INFO ] Implicit Places using invariants in 65 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/105 places, 35/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 34/105 places, 35/138 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s28 1) (LT s20 1)), p1:(GEQ s12 1), p2:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 835 reset in 352 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-08 finished in 572 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(p0)||F(p1)))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 116
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 55 place count 83 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 55 place count 83 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 77 place count 72 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 71 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 71 transition count 93
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 101 place count 60 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 59 transition count 81
Applied a total of 103 rules in 24 ms. Remains 59 /105 variables (removed 46) and now considering 81/138 (removed 57) transitions.
// Phase 1: matrix 81 rows 59 cols
[2024-05-31 16:58:27] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 16:58:27] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 16:58:27] [INFO ] Invariant cache hit.
[2024-05-31 16:58:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-31 16:58:27] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 16:58:27] [INFO ] Invariant cache hit.
[2024-05-31 16:58:27] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/105 places, 81/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 59/105 places, 81/138 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s27 1), p0:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1903 reset in 292 ms.
Stack based approach found an accepted trace after 336 steps with 8 reset with depth 45 and stack size 45 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-09 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)))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 106 place count 58 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 57 transition count 78
Applied a total of 108 rules in 18 ms. Remains 57 /105 variables (removed 48) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 57 cols
[2024-05-31 16:58:28] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 16:58:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 16:58:28] [INFO ] Invariant cache hit.
[2024-05-31 16:58:28] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-31 16:58:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 16:58:28] [INFO ] Invariant cache hit.
[2024-05-31 16:58:28] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 57/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-12 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 (GEQ s1 1) (GEQ s11 1) (GEQ s32 1))], 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 0 reset in 326 ms.
Stack based approach found an accepted trace after 1012 steps with 0 reset with depth 1013 and stack size 1013 in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-12 finished in 795 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 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 106 place count 58 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 57 transition count 78
Applied a total of 108 rules in 15 ms. Remains 57 /105 variables (removed 48) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 57 cols
[2024-05-31 16:58:28] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 16:58:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 16:58:28] [INFO ] Invariant cache hit.
[2024-05-31 16:58:29] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-31 16:58:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 16:58:29] [INFO ] Invariant cache hit.
[2024-05-31 16:58:29] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 57/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-13 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 (GEQ s0 1) (GEQ s7 1) (GEQ s32 1))], 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 0 reset in 171 ms.
Stack based approach found an accepted trace after 1027 steps with 0 reset with depth 1028 and stack size 1028 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-13 finished in 526 ms.
All properties solved by simple procedures.
Total runtime 21542 ms.

BK_STOP 1717174710434

--------------------
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="UtilityControlRoom-PT-Z2T3N06"
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 UtilityControlRoom-PT-Z2T3N06, 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 r461-smll-171701122800098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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